Maths Olympiad Prep

Library / /635 of 740

, 2016

Algebra Difficulty 5.4 AIME, harder Prove it United States

Problem:

Determine the largest integer nn such that there exist monic quadratic polynomials p1(x),p2(x),p3(x)p_{1}(x), p_{2}(x), p_{3}(x) with integer coefficients so that for all integers i[1,n]i \in [1, n] there exists some j[1,3]j \in [1,3] and mZm \in \mathbb{Z} such that pj(m)=ip_{j}(m) = i.

Solution

Solution:

The construction for n=9n=9 can be achieved with the polynomials x2+x+1x^{2}+x+1, x2+x+2x^{2}+x+2, and x2+5x^{2}+5.

First we consider what kinds of polynomials we can have. Let p(x)=(x+h)2+kp(x) = (x+h)^{2} + k. hh is either an integer or half an integer. Let k=0k=0. If hh is an integer then p(x)p(x) hits the perfect squares 0,1,4,90, 1, 4, 9, etc. If hh is half an integer, then let k=1/4k=1/4. Then p(x)p(x) hits the product of two consecutive integers, i.e. 0,2,6,120, 2, 6, 12, etc.

Assume there is a construction for n=10n=10. In both of the cases above, the most a polynomial can hit out of 1010 is 44, in the 0,1,4,90, 1, 4, 9 case. Thus p1p_{1} must hit 1,2,5,101, 2, 5, 10, and p2p_{2} and p3p_{3} hit 33 integers each, out of 3,4,6,7,8,93, 4, 6, 7, 8, 9. The only ways we can hit 33 out of 77 consecutive integers is with the sequences 0,2,60, 2, 6 or 0,1,40, 1, 4. The only way a 0,2,60, 2, 6 works is if it hits 3,53, 5, and 99, which doesn't work since 55 was hit by p2p_{2}. Otherwise, p2p_{2} is 0,1,40, 1, 4, which doesn't work as p2p_{2} hits 3,43, 4, and 77, and p3p_{3} must hit 6,86, 8, and 99, which is impossible. Thus no construction for n=10n=10 exists.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement reproduced verbatim; metadata (topic, difficulty) added by this project.