Browse · MathNet
PrintSAUDI ARABIAN MATHEMATICAL COMPETITIONS
Saudi Arabia algebra
Problem
Let be a polynomial of degree whose leading coefficient is . A positive integer is "nice" if there exists some positive integer such that . Suppose that there exist infinitely many positive integers such that are nice. Prove that there exists an arithmetic sequence of arbitrary length such that are all nice for
Solution
For convenience, denote .
Lemma. There exist a polynomial such that Proof. Suppose that is a polynomial such that is minimized (if there are many that satisfy, we choose one of them). It is easy to check that: - . - has leading coefficient . - . For iii), denote and suppose by contradiction that . Consider polynomial then The result is a polynomial of degree less than . This means which is a contradiction. Then, take to get From iii), we can see that then . The lemma is proved.
Since there exist infinitely many numbers such that is nice, we can choose some strictly increasing sequence of positive integers such that are nice for all . Clearly, for each , there exists such that . Since , which implies that then Now, let be the polynomial described in the lemma. Because , there exists a number such that . We have Hence, there is a number such that On the other hand, , so for all , then for all . This implies that for all .
Choose a number such that then we will prove that the arithmetic sequence given by the formula satisfies the given requirement. It is needed to clarify for all . Indeed, let then , then is divisible by . So leads to for all . This finishes the proof.
Lemma. There exist a polynomial such that Proof. Suppose that is a polynomial such that is minimized (if there are many that satisfy, we choose one of them). It is easy to check that: - . - has leading coefficient . - . For iii), denote and suppose by contradiction that . Consider polynomial then The result is a polynomial of degree less than . This means which is a contradiction. Then, take to get From iii), we can see that then . The lemma is proved.
Since there exist infinitely many numbers such that is nice, we can choose some strictly increasing sequence of positive integers such that are nice for all . Clearly, for each , there exists such that . Since , which implies that then Now, let be the polynomial described in the lemma. Because , there exists a number such that . We have Hence, there is a number such that On the other hand, , so for all , then for all . This implies that for all .
Choose a number such that then we will prove that the arithmetic sequence given by the formula satisfies the given requirement. It is needed to clarify for all . Indeed, let then , then is divisible by . So leads to for all . This finishes the proof.
Techniques
Polynomial operationsDivisibility / Factorization