Find the largest possible 3-digit positive integer such that is of the form , where , , , and are (not necessarily distinct) digits and .
(An example of a number of this form is 123,124 or 998,999.)
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 M be the three-digit number A B C . Then we want N 2 = 1 0 0 0 M + M + 1 = 1 0 0 1 M + 1 . So N 2 ≡ 1 mod 1 0 0 1 . Since 1 0 0 1 = 7 ⋅ 1 1 ⋅ 1 3 , this has eight solutions between 1 and 1 0 0 0 by the Chinese remainder theorem , by picking various signs in the congruences N N N ≡ ± 1 ( m o d 7 ) ≡ ± 1 ( m o d 1 1 ) ≡ ± 1 ( m o d 1 3 ) The eight solutions are N = 1 , 1 0 0 0 ; 4 2 8 , 5 7 3 ; 2 7 4 , 7 2 7 ; 1 5 5 , 8 4 6 . So the largest three-digit one is 8 4 6 .