Problem:
Call a positive integer in base -good if we can split it into two integers and , such that is all digits on the left and is all digits on the right, and such that . For example, is -good because we can split it into and and . is also -good, because we can split it into and . In addition, it is -good, because we can split it into and .
Show that there exists a -good perfect square.
Solution
Solution:
We wish to find integers , such that is a perfect square, where . This would prove that there exists a -good perfect square because we are pulling off the last digits of the number and get two integers and .
To make small by keeping the product a perfect square, we'd like to be divisible by some reasonably large square. Take . By Euler's theorem, , so is a multiple of .
Then we can take . (Clearly , so we're fine.) Then we have
Want a route through all this instead of an archive? The track
puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.