MathDB
Problems
Contests
Undergraduate contests
Putnam
1977 Putnam
A5
A5
Part of
1977 Putnam
Problems
(1)
Putnam 1977 A5
Source:
4/7/2022
Prove that
(
p
a
p
b
)
=
(
a
b
)
(
mod
p
)
\binom{pa}{pb}=\binom{a}{b} (\text{mod } p)
(
p
b
p
a
)
=
(
b
a
)
(
mod
p
)
for all integers
p
,
a
,
p,a,
p
,
a
,
and
b
b
b
with
p
p
p
a prime,
p
>
0
,
p>0,
p
>
0
,
and
a
>
b
>
0.
a>b>0.
a
>
b
>
0.
college contests