MathDB
Problems
Contests
National and Regional Contests
PEN Problems
PEN D Problems
9
D 9
D 9
Source:
May 25, 2007
modular arithmetic
Congruences
Problem Statement
Show that there exists a composite number
n
n
n
such that
a
n
≡
a
(
m
o
d
n
)
a^n \equiv a \; \pmod{n}
a
n
≡
a
(
mod
n
)
for all
a
∈
Z
a \in \mathbb{Z}
a
∈
Z
.
Back to Problems
View on AoPS