IMC / 2010 / Problems / Day 2, P10
IMC 2010 · Day 2 · P10
killerSuppose that for a function and real numbers one has for all . Prove that for all if for every prime number and every real number .
Solution (official)
Let be some integer to be defined later, and consider set of
real polynomials Notice that , any linear combinations of any elements in is in , and for every we have . Hence, is an ideal of the ring .
By the problem's conditions, for every prime divisors of we have . Since is a principal ideal domain (due to the Euclidean algorithm), the greatest common divisor of these polynomials is an element of . The complex roots of the polynomial are those th roots of unity whose order does not divide . The roots of the greatest common divisor is the intersection of such sets; it can be seen that the intersection consist of the primitive th roots of unity. Therefore, is the th cyclotomic polynomial. So , which polynomial has degree .
Now choose in such a way that . It is well-known that , so there exists such a value for . Let where and . Then, by the definition of , we have for all .
If , then On the right-hand side, all numbers lie in . Therefore the right-hand side is zero, and for all . It can be obtained similarly that for all as well. Hence, in the interval . Continuing in this fashion we see that must vanish everywhere.
How the field did
Score distribution (field cohort)
Computed on contestants with a meaningful total (field cohort); discrimination is the corrected item–total correlation.