What is the largest value of the 6-digit number satisfying the above condition?
This question is part of the set Shifting the numbers .
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.
We can represent the numbers A B C D E F and C D E F A B by using numbers x and y.
Let's define the numbers x and y as following: x = A B and y = C D E F .
Now, A B C D E F = 1 0 0 0 0 x + y and C D E F A B = 1 0 0 y + x .
Since C D E F A B A B C D E F = 1 7 1 2 is true, we know that 1 0 0 y + x 1 0 0 0 0 x + y = 1 7 1 2 is also true.
Therefore, 1 2 ( 1 0 0 0 0 x + y ) = 1 7 ( 1 0 0 y + x ) ⇒ 1 6 9 9 8 8 x = 1 1 8 3 y ⇒ 1 8 6 8 x = 1 3 y .
A B C D E F reaches it's largest value when A B is as large as possible.
We know that x must be a 2-digit number divisible by 13, and y must be a 4-digit number.
Since y must be a 4-digit number y < 1 0 0 0 0 ⇒ 1 8 6 8 x < 1 3 0 0 0 0 ⇒ x ≤ 6 9
Since 6 9 ≡ 4 (mod 13), and the largest value of A B C D E F is achieved when A B = x is as large as possible.
Therefore the largest possible value of x is 65, and therefore y is 9340, and therefore A B C D E F = 6 5 9 3 4 0 . □