MathDB
Problems
Contests
National and Regional Contests
Taiwan Contests
IMOC Shortlist
2023-IMOC
N5
Binomial congruence
Binomial congruence
Source: IMOC 2023 N5
September 9, 2023
number theory
Problem Statement
Let
p
=
4
k
+
1
p=4k+1
p
=
4
k
+
1
be a prime and let
∣
x
∣
≤
p
−
1
2
|x| \leq \frac{p-1}{2}
∣
x
∣
≤
2
p
−
1
such that
(
2
k
k
)
≡
x
(
m
o
d
p
)
\binom{2k}{k}\equiv x \pmod p
(
k
2
k
)
≡
x
(
mod
p
)
. Show that
∣
x
∣
≤
2
p
|x| \leq 2\sqrt{p}
∣
x
∣
≤
2
p
.
Back to Problems
View on AoPS