Difference between revisions of "1962 IMO Problems/Problem 1"
(→Problem) |
(solution) |
||
Line 19: | Line 19: | ||
==Solution 2== | ==Solution 2== | ||
+ | We know from the two properties that for some string <math>x</math>, <math>n=10x+6</math>. Let the number of digits in <math>x</math> be <math>a</math>; then moving the <math>6</math> to the front would give it place value <math>10^a</math>; as a result, <math>4n=6\cdot10^a+x</math>. Multiplying this by <math>10</math> gives <math>40n=6\cdot10^{a+1}+10x</math>, and subtracting the former yields <math>39n=6(10^{a+1}-1)</math>, or <math>13n=2(10^{a+1}-1)</math>. As a result, <math>13|(10^{a+1}-1)</math>. By [[Fermat's Little Theorem]], we know that <math>10^12-1</math> divides <math>13</math>, so it isn't difficult to try values of <math>a+1</math> less than <math>13</math>. Eventually, we notice that <math>10^6-1</math> divides <math>13</math>, so <math>a=5</math>. Then <math>\boxed{n=153846}</math>, and since the number ends in <math>6</math>, we know that <math>x</math> is also an integer, so this is the solution. | ||
− | + | ~eevee9406 | |
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
− | |||
==See Also== | ==See Also== | ||
{{IMO box|year=1962|before=First Question|num-a=2}} | {{IMO box|year=1962|before=First Question|num-a=2}} |
Revision as of 10:08, 15 March 2025
Problem
Find the smallest natural number which has the following properties:
(a) Its decimal representation has 6 as the last digit.
(b) If the last digit 6 is erased and placed in front of the remaining digits, the resulting number is four times as large as the original number .
Video Solution
https://youtu.be/9y5UUNIhUfU?si=PzXbNokxOXCRxYBh [Video Solution by little-fermat]
Solution 1
As the new number starts with a and the old number is
of the new number, the old number must start with a
.
As the new number now starts with , the old number must start with
.
We continue in this way until the process terminates with the new number and the old number
.
Solution 2
We know from the two properties that for some string ,
. Let the number of digits in
be
; then moving the
to the front would give it place value
; as a result,
. Multiplying this by
gives
, and subtracting the former yields
, or
. As a result,
. By Fermat's Little Theorem, we know that
divides
, so it isn't difficult to try values of
less than
. Eventually, we notice that
divides
, so
. Then
, and since the number ends in
, we know that
is also an integer, so this is the solution.
~eevee9406
See Also
1962 IMO (Problems) • Resources | ||
Preceded by First Question |
1 • 2 • 3 • 4 • 5 • 6 | Followed by Problem 2 |
All IMO Problems and Solutions |