# Solution: 2011-9 Distinct prime factors

Prove that there is a constant c>1 such that if  $$n>c^k$$ for positive integers n and k, then the number of distinct prime factors of $$n \choose k$$ is at least k.

The best solution was submitted by Minjae Park (박민재), KAIST 2011학번. Congratulations!

Here is his Solution of Problem 2011-9.

An alternative solution was submitted by 어수강 (홍익대 수학교육과 2004학번, +3).

GD Star Rating