MathDB
Problems
Contests
National and Regional Contests
PEN Problems
PEN A Problems
14
A 14
A 14
Source:
May 25, 2007
Putnam
modular arithmetic
number theory
Divisibility Theory
Problem Statement
Let
n
n
n
be an integer with
n
≥
2
n \ge 2
n
≥
2
. Show that
n
n
n
does not divide
2
n
−
1
2^{n}-1
2
n
−
1
.
Back to Problems
View on AoPS