Daily

Random

Practice set

Baltic Way 2023 · Problem 16

Number Theory

Prove that there exist nonconstant polynomials ff and gg with integer coefficients such that, for infinitely many primes pp, there are no integers xx and yy with p∣f(x)−g(y)p \mid f(x)-g(y).

Change pool

When you’re ready

Review material becomes available with the next Daily.

Review

Topics

Modular arithmetic · Orders and residues

Solutions

Solution

We take f(x)=(x2+1)2f(x) = (x^2 + 1)^2 and g(y)=−(y2+1)2g(y) = -(y^2 + 1)^2 and prove that if p≡3(mod4)p \equiv 3 \pmod 4 then the equation f(x)≡g(y)(modp)f(x) \equiv g(y) \pmod p has no solution. Famously, there are infinitely many primes congruent to 33 modulo 44.

Recall the fact that if p≡3(mod4)p \equiv 3 \pmod 4 then the only solution to the equation a2+b2≡0(modp)a^2 + b^2 \equiv 0 \pmod p is a≡b≡0(modp)a \equiv b \equiv 0 \pmod p. Hence, for f(x)≡g(y)(modp)f(x) \equiv g(y) \pmod p to hold, we need

(x2+1)2+(y2+1)2≡0(modp)(x^2 + 1)^2 + (y^2 + 1)^2 \equiv 0 \pmod{p}

and thus

x2+1≡y2+1≡0(modp),x^2 + 1 \equiv y^2 + 1 \equiv 0 \pmod{p},

which is impossible for p≡3(mod4)p \equiv 3 \pmod 4.

Contest context

Results from Baltic Way 2023

10 teams

Mean score
2.1 / 5
Scores of 4 or 5
4 / 10
Estonia
5 / 5

Score distribution

05
11
20
30
40
54
All team scores
TeamScore
Germany5 / 5
Sweden5 / 5
Lithuania5 / 5
Poland0 / 5
Estonia5 / 5
Latvia1 / 5
Norway0 / 5
Denmark0 / 5
Finland0 / 5
Iceland0 / 5