Browse · MathNet
PrintSaudi Arabian IMO Booklet
Saudi Arabia algebra
Problem
For each non-constant integer polynomial , let's define 1. Find the minimum value of when . 2. Suppose that when and . Prove that .
Solution
1) Since , put with and . Note that Thus, which implies that On the other hand, satisfies the condition . Hence, the minimum value of is , the equality holds when .
2) Suppose that there is some integer polynomial with One can see that thus . By the property of integer polynomials, so which leads to From that, let's put with and . So . If there exists such that then From this, we can conclude that so let's write with then . Note that if then . Similarly, also leads to another contradiction, so then there is some for which Since then . On the other hand, so , which contradicts being non-constant. Therefore, the contrary hypothesis is false and it follows that .
2) Suppose that there is some integer polynomial with One can see that thus . By the property of integer polynomials, so which leads to From that, let's put with and . So . If there exists such that then From this, we can conclude that so let's write with then . Note that if then . Similarly, also leads to another contradiction, so then there is some for which Since then . On the other hand, so , which contradicts being non-constant. Therefore, the contrary hypothesis is false and it follows that .
Final answer
Part 1: 1011. Part 2: For degrees from two to two thousand twenty two, M_P is at least 1011.
Techniques
Polynomial operationsPolynomials mod p