Daily

Random

Practice set

Baltic Way 1998 · Problem 4

Number Theory

Let PP be a polynomial with integer coefficients. Suppose that for n=1,2,3,…,1998n=1,2,3, \ldots, 1998 the number P(n)P(n) is a three-digit positive integer. Prove that the polynomial PP has no integer roots.

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Modular arithmetic

Solutions

Solution

Solution:

Let mm be an arbitrary integer and define n∈{1,2,…,1998}n \in \{1,2, \ldots, 1998\} to be such that m≡n(mod1998)m \equiv n \pmod{1998}. Then P(m)≡P(n)(mod1998)P(m) \equiv P(n) \pmod{1998}. Since P(n)P(n) as a three-digit number cannot be divisible by 19981998, then P(m)P(m) cannot be equal to 00. Hence PP has no integer roots.

Contest context

Results from Baltic Way 1998

11 teams

Mean score
2.3 / 5
Scores of 4 or 5
5 / 11
Estonia
0 / 5

Score distribution

06
10
20
30
40
55
All team scores
TeamScore
Latvia5 / 5
Estonia0 / 5
Poland5 / 5
Finland5 / 5
St. Petersburg5 / 5
Sweden0 / 5
Denmark0 / 5
Iceland5 / 5
Norway0 / 5
Germany0 / 5
Lithuania0 / 5