Let and be positive integer numbers having no common divisors except of . Prove that is prime if and only if all the coefficients of the polynomial are divisible by .
Problem 1469
Official solution
1. Lemma 1: If is prime, then is always divisible by for .
Proof of Lemma 1:
Notice that the denominator is the product of numbers less than , so it can't possibly be divisible by . Since the numerator is divisible by , and the expression is obviously an integer, we can conclude that .
2. Only if direction: Assume is prime. We need to show that all coefficients of the polynomial are divisible by .
- For :
Notice that:
Hence, all coefficients are divisible by .
- For being an odd prime:
Using the binomial expansion:
Therefore:
Simplifying, we get:
By Lemma 1, each for is divisible by . Hence, all coefficients are divisible by .
3. If direction: Assume all coefficients of are divisible by . We need to show that is prime.
- Suppose is not prime. Let be the largest prime factor of . Consider:
It is clear that exactly one of the terms in the numerator can be divisible by , so that must be . Since the denominator must have one factor of (since is prime), has one less factor of than . Therefore, can't possibly be divisible by .
- Since is one of the coefficients (possibly multiplied by ), not all of the coefficients are divisible by if is not prime. This contradicts our assumption that all coefficients are divisible by .
Hence, must be prime.