MathDB
Divisibility

Source: JBMO 2006

June 29, 2006
floor functionnumber theory unsolvednumber theory

Problem Statement

If n>4n>4 is a composite number, then 2n2n divides (nāˆ’1)!(n-1)!.
Back to ProblemsView on AoPS