Learn More
Let N(t) denote the number of times the integer t > 1 occurs as a binomial coefficient ; that is, N(t) is the number of solutions of t = (n in integers n and r. r We have N(2) = 1, N(3) = N(4) = N(5) = 2, N(6) = 3, etc. In a recent note in the research problems section of the MONTHLY, D. Singmaster [1] proved that N(t) = O(log t). He conjectured that N(t) =(More)
  • 1