What is the largest positive integer such that there exist solution for the 6-digit number ?
There exist a solution for but it is not the largest.
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.
Let A B = x and C D E F = y . Then 1 0 2 y + x 1 0 4 x + y = n + 5 n . This eventually will imply that x y = 9 9 n − 5 9 9 9 9 n + 5 0 0 0 0 . Since y is a 4-digit number, g cd ( 9 9 9 9 n + 5 0 0 0 0 , 9 9 n − 5 ) 9 9 9 9 n + 5 0 0 0 0 < 1 0 0 0 0 . Let d = g cd ( 9 9 9 9 n + 5 0 0 0 0 , 9 9 n − 5 ) . If d < n , then d 9 9 9 9 n + 5 0 0 0 0 > n 9 9 9 9 n + 5 0 0 0 0 = 9 9 9 9 + n 5 0 0 0 0 > 1 0 0 0 0 . Hence we only interested those d > n .
It is known that g cd ( a , b ) = g cd ( a , b − k a ) . Now d = g cd ( 9 9 n − 5 , 9 9 9 9 n + 5 0 0 0 0 ) = g cd ( 9 9 n − 5 , 5 0 5 0 5 ) . Note that 5 0 5 0 5 = 3 ( 5 ) ( 7 ) ( 1 3 ) ( 3 7 ) and d = 3 . The largest possible d = 3 5 0 5 0 5 = 1 6 8 3 5 .
If d = 1 6 8 3 5 , then 9 9 n − 5 = 1 6 8 3 5 m for some m ∈ N , which yields { n = 1 6 6 6 5 + 1 6 8 3 5 t m = 9 8 + 9 9 t for some t ∈ Z (It requires some workings here). Since we only interested in those d > n , set t = 0 . This means that n = 1 6 6 6 5 .
Check : If n = 1 6 6 6 5 , x y = 9 9 n − 5 9 9 9 9 n + 5 0 0 0 0 = 9 8 9 9 0 1 which means that y = 9 9 0 1 and x = 9 8 .
We shall show that n = 1 6 6 6 5 is the largest. To see this, note that the next largest value of d (non-multiple 3) is 3 ( 5 ) 5 0 5 0 5 = 3 3 6 7 . For each d we consider, n < d ≤ 3 3 6 7 .
This completes the proof.