20. N2 (RUS) The positive integers and are such that the numbers and are both squares of positive integers. What is the least possible value that can be taken on by the smaller of these two squares?
Solution
20. Let and , where . Then we obtain .
In particular, . We have the following lemma. Lemma. Suppose that , where and is an odd prime, where . Then and .
Proof. Since and by Fermat's theorem , we deduce that , where . But , so . Thus , which implies that , i.e., and .
In particular, we can conclude that and . Hence and are divisible by 481 . Thus each of them is at least 481 .
On the other hand, is possible. It is sufficient to take 31 - 481 and .
Second solution. Note that . It can be directly verified that the divisibility of by 13 and by 37 implies that both and are divisible by both primes. Thus .
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.