MathDB
Problems
Contests
International Contests
IMO Shortlist
1997 IMO Shortlist
12
12
Part of
1997 IMO Shortlist
Problems
(1)
Prove that d >= p-1
Source: IMO Shortlist 1997, Q12
8/26/2005
Let
p
p
p
be a prime number and
f
f
f
an integer polynomial of degree
d
d
d
such that
f
(
0
)
=
0
,
f
(
1
)
=
1
f(0) = 0,f(1) = 1
f
(
0
)
=
0
,
f
(
1
)
=
1
and
f
(
n
)
f(n)
f
(
n
)
is congruent to
0
0
0
or
1
1
1
modulo
p
p
p
for every integer
n
n
n
. Prove that
d
≥
p
−
1
d\geq p - 1
d
≥
p
−
1
.
algebra
polynomial
modular arithmetic
congruence
IMO Shortlist