Maths Olympiad Prep

Library / /24 of 27

Algebra Difficulty 6.9 National olympiad Prove it Croatia

Let S={0,95}S = \{0, 95\}. In each step, Lucija is extending the set SS in the following way. She chooses a polynomial with coefficients in SS, distinct from zero, and extends SS with all integer roots of a chosen polynomial. She repeats the procedure by choosing another polynomial with coefficients from the extended set SS as long as she can get new roots.
Prove that Lucija can, in a finite number of steps, extend the set SS up to the set which is no longer extensible. How many elements does the set SS have at the end?

Solution

If the coefficients of a polynomial are integers, then its roots must divide the constant term. Without loss of generality, we may assume that the constant term of the chosen polynomial is non-zero, so we conclude that we can extend SS only with the divisors of 9595. Since 9595 has only finitely many divisors, Lucija will not be able to extend SS indefinitely.

We will prove that Lucija can add all the divisors of 9595 into SS, i.e. that SS will have 99 elements in the end.

Since 1-1 is the root of the polynomial 95x+9595x + 95, we can add 1-1 to SS.

Number 11 is a root of x9x94x+95-x^9 - x^{94} - \dots - x + 95, so SS can be extended with 11.

Now we can extend SS with 95-95 because it is the root of x+95x + 95.

Polynomial x3+x2+x+95-x^3 + x^2 + x + 95 with coefficients in SS has a root 55, hence 55 becomes an element of SS. Now we add 5-5 into SS, because 5-5 is the root of x+5x + 5.

In the end, 19-19, 19S19 \in S since these are the roots of polynomials 5x+955x + 95 and 5x955x - 95.

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 and solution reproduced as published; topic and difficulty added by this site.