Singmaster’s Conjecture

https://commons.wikimedia.org/wiki/File:%D0%A2%D1%80%D0%B5%D1%83%D0%B3%D0%BE%D0%BB%D1%8C%D0%BD%D0%B8%D0%BA_%D0%9F%D0%B0%D1%81%D0%BA%D0%B0%D0%BB%D1%8F.png
Image: Wikimedia Commons

In Pascal’s triangle, each number is the sum of the two above it. Obviously, the infinite pyramid contains an infinite number of 1s, but most numbers appear surprisingly seldom:

  • 2 appears just once.
  • 3, 4, 5, and all odd primes appear exactly twice.
  • 6 appears three times.
  • Infinitely many numbers appear exactly six times, but we don’t know whether any appear exactly five or seven times.
  • 3003 appears eight times, possibly the only such specimen.

In 1971, Berkeley mathematician David Singmaster suggested that there may be a finite upper bound on the number of times that any number can appear (apart from 1). But that remains an unsolved problem.