Number theoryDifficulty 5.4AIME, harderProve itCroatia
For a given prime number p determine all integers n such that n2+pn is an integer.
Solution
Let n2+pn=m, m∈N0. Then n2+pn−m2=0. The solutions of this quadratic equation are n=21(−p±p2+4m2). The solutions are integers, so p2+4m2=w2, for some w∈N0. Since w+2m≥0 and w+2m≥w−2m, from p2=(w−2m)(w+2m), we obtain the following possibilities: {w−2m=1w+2m=p2or{w−2m=pw+2m=p In the first case we obtain w=2p2+1, m=4p2−1, so it follows: nn1=21−p±p2+4(4p2−1)2=(2p−1)2,n2=−(2p+1)2. These numbers are integers only when p is odd, i.e. only if p>2.
In the second case we obtain w=p, m=0, so it follows that n=21(−p±p) or n3=0 and n4=−p.
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 and solution reproduced as published; topic and difficulty added by this site.