Number theoryDifficulty 5.1AIME, harderProve itBelarus
A positive integer n>10 has two different positive integer divisors a and b such that n=a2+b. Prove that strictly between the numbers a and b there is at least one another divisor of n.
Solution
From the equality n=a2+b it follows that b is divisible by a, since a divides both n and a2. Let b=ma, where m>1. Then n=a2+ma=a(a+m), so a+m divides n. Let us show that a<a+m<b. Suppose a+m≥b, then a+m≥ma⟺am−a−m+1≤1⟺(a−1)(m−1)≤1. The latter inequality holds only if a=m=2 whence b=4, but then n=2⋅4=8<10, which contradicts with the conditions of the problem. Therefore, a+m is the required divisor of n, located between a and b.
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.
Source: MathNet,
licensed CC-BY-4.0.
Statement reproduced verbatim; metadata (topic, difficulty) added by this project.