Competition problem — Number theory

Library / /15 of 32

Number theory Difficulty 5.7 AIME, harder Prove it Estonia

Prove or disprove: For every integer $n > 0$ , there is a polynomial $a_n x^n + a_{n-1} x^{n-1} + \dots + a_1 x + a_0$ satisfying the following conditions:
(1) All coefficients $a_n, a_{n-1}, \dots, a_1, a_0$ are positive real numbers;
(2) At least one of the coefficients is $\frac{1}{n}$ ;
(3) The value of the polynomial is integer for every integer $x$ .

Solution

The product of any $n$ consecutive integers is divisible by $n$ . Thus the conditions are satisfied by the polynomial obtained by removing parentheses and collecting terms in the expression $\frac{1}{n}(x+1)\dots(x+n)$ .

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.