MathDB
Problems
Contests
National and Regional Contests
Italy Contests
Italy TST
2002 Italy TST
2
Divisiblity with a binomial
Divisiblity with a binomial
Source: Italy TST 2002
November 9, 2010
modular arithmetic
number theory unsolved
number theory
Problem Statement
Prove that for each prime number
p
p
p
and positive integer
n
n
n
,
p
n
p^n
p
n
divides
(
p
n
p
)
−
p
n
−
1
.
\binom{p^n}{p}-p^{n-1}.
(
p
p
n
)
−
p
n
−
1
.
Back to Problems
View on AoPS