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.

GD Star Rating
2011-9 Distinct prime factors, 4.1 out of 5 based on 18 ratings

2 thoughts on “2011-9 Distinct prime factors

  1. ESK

    아직 풀이가 안올라왔네요. 23일 토요일에 풀이 제출했는데 제 풀이에 오류가 있는건가요? ㅠㅠ

Comments are closed.