Maths Olympiad Prep

Library / /4 of 5

Number theory Difficulty 5.7 AIME, harder Prove it Philippines

Problem:

Let pp be a prime number. Let aa, bb, and cc be integers that are divisible by pp such that the equation x3+ax2+bx+c=0x^{3} + a x^{2} + b x + c = 0 has at least two different integer roots. Prove that cc is divisible by p3p^{3}.

Solution

Solution:

Let rr and ss be two different integral roots of x3+ax2+bx+c=0x^{3} + a x^{2} + b x + c = 0; that is, r3+ar2+br+c=0r^{3} + a r^{2} + b r + c = 0 and s3+as2+bs+c=0s^{3} + a s^{2} + b s + c = 0. Since pp divides aa, bb, and cc, it follows that pp divides both r3r^{3} and s3s^{3}. Being prime, pp divides rr and ss.

Subtracting the above equations involving rr and ss, we get
r3s3+a(r2s2)+b(rs)=0, or (rs)(r2+rs+s2+a(r+s)+b)=0 r^{3} - s^{3} + a(r^{2} - s^{2}) + b(r - s) = 0, \text{ or } (r - s)\left(r^{2} + r s + s^{2} + a(r + s) + b\right) = 0
Since rsr \neq s, the last equation becomes
r2+rs+s2+a(r+s)+b=0 r^{2} + r s + s^{2} + a(r + s) + b = 0
Because the terms (other than bb) are divisible by p2p^{2}, the last equation forces p2p^{2} to divide bb.

Finally, the terms (other than cc) of r3+ar2+br+c=0r^{3} + a r^{2} + b r + c = 0 are divisible by p3p^{3}, it follows that p3p^{3} divides cc.

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.