Daily

Random

Practice set

Baltic Way 2019 · Problem 20

Number Theory

Let us consider a polynomial P(x)P(x) with integer coefficients satisfying

P(−1)=−4,P(−3)=−40,P(−5)=−156.P(-1)=-4,\qquad P(-3)=-40,\qquad P(-5)=-156.

What is the largest possible number of integers xx satisfying

P(P(x))=x2?P(P(x))=x^2?
Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Modular arithmetic · Orders and residues

Solutions

Solution

No such numbers xx can ever exist. To see this, let us recall that when xx is an integer, the right-hand side of the equation is always ≡0(mod3)\equiv 0 \pmod{3} or 1(mod3)1 \pmod{3}. We recall also that when xx and yy are integers, we have

P(x)≡P(y)(mod3),wheneverx≡y(mod3).P(x) \equiv P(y) \pmod{3}, \quad \text{whenever} \quad x \equiv y \pmod{3}.

Therefore

P(x)≡P(−3)≡−40≡2(mod3)whenx≡0(mod3),P(x) \equiv P(-3) \equiv -40 \equiv 2 \pmod{3} \quad \text{when} \quad x \equiv 0 \pmod{3},

and similarly

P(x)≡P(−5)≡−156≡0(mod3)whenx≡1(mod3),P(x) \equiv P(-5) \equiv -156 \equiv 0 \pmod{3} \quad \text{when} \quad x \equiv 1 \pmod{3},

and

P(x)≡P(−1)≡−4≡2(mod3),whenx≡2(mod3).P(x) \equiv P(-1) \equiv -4 \equiv 2 \pmod{3}, \quad \text{when} \quad x \equiv 2 \pmod{3}.

In particular, P(x)P(x) is always ≡0(mod3)\equiv 0 \pmod{3} or ≡2(mod3)\equiv 2 \pmod{3}, and P(P(x))P(P(x)) is always ≡2(mod3)\equiv 2 \pmod{3}. Therefore we always have P(P(x))≢x2(mod3)P(P(x)) \not\equiv x^2 \pmod{3} for every integer xx.

Contest context

Results from Baltic Way 2019

11 teams

Mean score
1.5 / 5
Scores of 4 or 5
3 / 11
Estonia
4 / 5

Score distribution

06
11
21
30
41
52
All team scores
TeamScore
St. Petersburg5 / 5
Poland0 / 5
Estonia4 / 5
Lithuania1 / 5
Germany0 / 5
Norway5 / 5
Finland0 / 5
Denmark0 / 5
Sweden0 / 5
Latvia2 / 5
Iceland0 / 5