• Aucun résultat trouvé

Épreuve de section européenne

N/A
N/A
Protected

Academic year: 2022

Partager "Épreuve de section européenne"

Copied!
1
0
0

Texte intégral

(1)

Baccalauréat, toutes séries Session de juin 2012

Épreuve de section européenne

The amazing number 6174

At first glance, the number 6174 looks like any other number. Perhaps this is what makes this unassuming number so remarkable. In 1949, Indian mathematician D. R. Kaprekar, discovered the mysterious beauty of 6174 after devising a process that we now know as Kaprekar’s operation.

The algorithm:

• start with any four-digit number such that not all of its digits are equal;

• re-arrange the digits in ascending order to make one four-digit number and in descending order to make a second four-digit number (don’t forget the possible zeros);

• subtract the smaller number from the larger number;

• repeat until you get the same number for every iteration.

You’ll always end up with 6174 within seven or fewer iterations. After you get that number, you can repeat this operation until the end of time, you will always get the same answer: 6174.

For example, if we choose the year 2011 as our starting four-digit number, we end up with:

1 2110−0112 = 1998 ;2 9981−1899 = 8082 ;3 8820−0288 = 8532 ;4 8532−2358 = 6174 : it took just four iterations to reach 6174. From this point onwards, this operation can be repeated and it will always yield the same answer: 7641−1467 = 6174.

What does this mean? Well, nothing really. It’s just one of those marvellous things that we can simply enjoy for what it is. But I’ll bet those of you who like indulging in bar bets will enjoy this maths trick.

Adapted from GrrlScientist’s column,The Guardian, 12 December 2011.

Questions

1. Why is the algorithm not working when all the digits are equal?

2. Starting with year 2011, you need four iterations. Is year 2012 longer or quicker? And what about year 1949, which is the year of Kaprekar’s birth?

3. We can adapt Kaprekar’s algorithm to 3-digit numbers (whose digits are not all equal). Try several 3-digit numbers; what is your conjecture?

4. Prove your conjecture of question 2 (Hint: the digits of the number area,bandc; you can suppose without loss of generality thatais the lesser andcis the greater.)

5. You probably noticed that all the numbers generated after the first iteration in question 1 are divisible by 9. Prove it.

6. The original text was subtitled: because not everything has to be useful to be interesting! Could you give several examples of useless things that are interesting to you, both in mathematics and in everyday life?

2012-04 – The amazing number 6174

Références

Documents relatifs

(A) Simulations of a small (1.5 µm) and large (6.5 µm) dendritic compartment with a uniform concentration of PDE4 in both compartments and an asymmetric density of adenylyl cyclase

L’accès à ce site Web et l’utilisation de son contenu sont assujettis aux conditions présentées dans le site LISEZ CES CONDITIONS ATTENTIVEMENT AVANT D’UTILISER CE SITE WEB.

To achieve this objective and despite twenty years of research on durability of concrete structures, many obstacles have still to be tackled such as: lack of suitable

As children get older (and calculation procedures would become more automatized), we predicted that dRTs would become more positive for addition problems (i.e., an increase in

Misconception: Farmer seed networks are considered to be of limited value to agricultural development because they are closed systems that circulate seed of local varieties

Nevertheless, Benford’s law applies quite well to various kinds of financial data: it has even been possible to discover some financial frauds because suspicion arose from the fact

In contrast, for the three- and four-jet cases, both the NLO and ME þ PS predictions agree with the data, within the experimental uncertainties, whether or not we account for the

Cette importance du port d’Abidjan dans la relance économique de la Côte d’Ivoire se perçoit également au niveau du développement industriel. 15 Séka Charles, enquête orale,