MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

Has any work been done on Singmaster's conjecture since Singmaster's work?

The conjecture says there is a finite upper bound on how many times a number other than 1 can occur as a binomial coefficient.

Wikipedia's article on it, written mostly by me, says that

  • It is known that infinitely many numbers appear exactly 3 times.
  • It is unknown whether any number appears an odd number of times where the odd number is bigger than 3.
  • It is known that infinitely many numbers appear 2 times, 4 times, and 6 times.
  • One number is known to appear 8 times. No one knows whether there are any others nor whether any number appears more than 8 times.
  • Singmaster reported that Paul Erdős told him the conjecture is probably true but would probably be very hard to prove.
share|cite|improve this question
There are infinetely many numbers that could be found many times in Pascal's triangle.In fact it contains infinitely many many partterns,finite and non finite.The shape could become inflated and changed though to encompass some missing numbers or intergers. – user68553 Feb 26 '15 at 9:25
@LeonKay : If by "many" you mean more than eight, then your claim is somewhat bold unless "could be found" merely means that you personally do not know whether they are there. As for "inflated and changed", some specificity about your meaning is needed. – Michael Hardy Feb 26 '15 at 15:41
up vote 18 down vote accepted

There is an upper bound of $O\left(\frac{(\log n)(\log \log \log n)}{(\log \log n)^3}\right)$ due to Daniel Kane: see "Improved bounds on the number of ways of expressing t as a binomial coefficient," Integers 7 (2007), #A53 for details.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.