MathDB
Problems
Contests
National and Regional Contests
Canada Contests
Canada National Olympiad
1985 Canada National Olympiad
4
2^(n-1) | n! if and only if n is a power of 2 [Canada 1985]
2^(n-1) | n! if and only if n is a power of 2 [Canada 1985]
Source:
September 30, 2011
floor function
logarithms
inequalities
number theory
prime factorization
Problem Statement
Prove that
2
n
−
1
2^{n - 1}
2
n
−
1
divides
n
!
n!
n
!
if and only if
n
=
2
k
−
1
n = 2^{k - 1}
n
=
2
k
−
1
for some positive integer
k
k
k
.
Back to Problems
View on AoPS