MathDB
Problems
Contests
National and Regional Contests
PEN Problems
PEN A Problems
30
A 30
A 30
Source:
May 25, 2007
Divisibility Theory
Problem Statement
Show that if
n
≥
6
n \ge 6
n
≥
6
is composite, then
n
n
n
divides
(
n
−
1
)
!
(n-1)!
(
n
−
1
)!
.
Back to Problems
View on AoPS