A six-digit number when multiplied by and respectively, has the same digits but in different orders. Find the original number .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
The maximum value of a b c d e f in order to retain only 6 digits when multiplied by 6 is 1 6 6 6 6 6 , leading to a = 1 .
It's not too hard to prove that the first number must always increase when multiplied by 2 , 3 , 4 , 5 and 6 , so the first number of each multiplication forms a sequence of six increasing numbers, starting with 1 , meaning that all the digits of a b c d e f must be different (and greater than or equal to 1 ). This rules out 0 from being any of the digits.
Multiplying an even number by 5 results in an ending 0 , and thus f must be odd. We can also rule out f = 5 for the same reason.
Now let's consider the last digits of f = 1 , f = 3 and f = 9 :
For f = 1 , the final digits following the respective multiplications are 1 , 2 , 3 , 4 , 5 and 6 . But a = 1 and f = 1 , leaving 2 , 3 , 4 , 5 and 6 for 4 remaining digits, which is an impossibility.
Applying the same logic yields last digits of 3 , 6 , 9 , 2 , 5 and 8 for f = 1 and 9 , 8 , 7 , 6 , 5 and 4 for f = 9 , both of which produce too many distinct digits.
Therefore f = 7 and the digits of a b c d e f must be 1 , 2 , 4 , 5 , 7 and 8 in some order. We can see that the first digit of the original is 1 , the first digit after multiplication by 2 is 2 , the first digit after multiplication by 3 is 4 , the first digit after multiplication by 4 is 5 etc etc
This tells us that b cannot exceed 4 (seeing as that would cause the first digit after multiplication by 2 to be a 3 ), so b = 2 or b = 4 . But b cannot be 2 because then the maximum value of a b c d e f is 1 2 8 5 4 7 ; when this is multiplied by 5 we cannot obtain the first digit of 7 , we fall short at six-hundred thousand. So b = 4 .
Thus, the remaining solutions are 1 4 8 5 2 7 , 1 4 8 2 5 7 , 1 4 5 8 2 7 , 1 4 5 2 8 7 , 1 4 2 8 5 7 and 1 4 2 5 8 7 . Of these, only 1 4 2 8 5 7 is valid, and we can check this by computing the 5 operations:
1 4 2 8 5 7 × 2 = 2 8 5 7 1 4
1 4 2 8 5 7 × 3 = 4 2 8 5 7 1
1 4 2 8 5 7 × 4 = 5 7 1 4 2 8
1 4 2 8 5 7 × 5 = 7 1 4 2 8 5
1 4 2 8 5 7 × 6 = 8 5 7 1 4 2
Interestingly, this is the recurrence pattern of 7 1 = 0 . 1 4 2 8 5 7 1 4 2 8 5 7 . . . , and probably the most widely known cyclic number .