Problem:
Let be a prime number. Let , , and be integers that are divisible by such that the equation has at least two different integer roots. Prove that is divisible by .
Problem:
Let be a prime number. Let , , and be integers that are divisible by such that the equation has at least two different integer roots. Prove that is divisible by .
Solution:
Let and be two different integral roots of ; that is, and . Since divides , , and , it follows that divides both and . Being prime, divides and .
Subtracting the above equations involving and , we get
Since , the last equation becomes
Because the terms (other than ) are divisible by , the last equation forces to divide .
Finally, the terms (other than ) of are divisible by , it follows that divides .