| 释义 |
Singmaster's conjecture There is an integer n such that all numbers in Pascal's triangle appear fewer than n times (excepting the 1s at the start and end of each row). It is known that there are infinitely many numbers that appear (at least) 6 times, but currently 3003 is the only number known to appear 8 times. The conjecture was made by David Singmaster in 1971.
|