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
loading...
2011-9 Distinct prime factors,
loading...
KAIST Math Problem of the Week
Weekly Math Challenges in KAIST
아직 풀이가 안올라왔네요. 23일 토요일에 풀이 제출했는데 제 풀이에 오류가 있는건가요? ㅠㅠ
바쁜 일로 아직 처리를 못했네요..