Singmaster's conjecture on repeated binomial coefficients

How many times can the same number appear in Pascal's triangle? The number 3003 appears eight times, and no number is known to appear more often. Erdős and Gordon asked whether every multiplicity is possible; Singmaster conjectured, and Erdős believed, that the multiplicities are bounded.

Problem

For an integer $a>1$ count the solutions of

\binom{n}{k}=a,\qquad 1\le k\le n/2,

so that each pair of symmetric entries of Pascal's triangle is counted once. Is it true that for every $t\ge1$ there is an integer $a$ with exactly $t$ solutions?

Known examples: $a=120=\binom{120}{1}=\binom{16}{2}=\binom{10}{3}$ has three solutions, and $a=3003=\binom{3003}{1}=\binom{78}{2}=\binom{15}{5}=\binom{14}{6}$ has four. No number with five or more solutions is known.

Background

Erdős credited the question to himself and Basil Gordon "many years ago"; in the literature it is usually discussed as Singmaster's conjecture, after David Singmaster's 1971 note asking for an absolute bound on the number $N(a)$ of times $a>1$ occurs in Pascal's triangle (counting both $\binom{n}{k}$ and $\binom{n}{n-k}$ ). Both Erdős and Singmaster expected such a bound to exist, which would answer the question above negatively. Assuming Cramér's conjecture on gaps between primes, Abbott, Erdős and Hanson showed $N(a)=O((\log a)^{2/3+\varepsilon})$ .

What is known

Upper bounds on $N(a)$ . Singmaster (1971) proved $N(a)=O(\log a)$ ; Abbott, Erdős and Hanson (1974) improved this to $O(\log a/\log\log a)$ ; the best unconditional bound is $O\big((\log a)(\log\log\log a)/(\log\log a)^3\big)$ by Kane (2007).
The interior of the triangle. Matomäki, Radziwiłł, Shao, Tao and Teräväinen (2022) proved that, for $a$ large in terms of $\varepsilon$ , there are at most two solutions with $k\ge\exp((\log n)^{2/3+\varepsilon})$ .
Lower bounds. Singmaster (1975) found infinitely many numbers that occur at least six times in the full triangle, that is, with at least three solutions in the count above.

What would count as progress

A number with five solutions (a ninth or tenth appearance in the full triangle), found by search and checked by exact arithmetic.
A proof that $N(a)$ is bounded, or any improvement of Kane's bound.
Extending the interior result of Matomäki et al. to smaller $k$ .
A formal proof against the Lean statement in formal-conjectures.

References

D. Singmaster, How often does an integer occur as a binomial coefficient?, Amer. Math. Monthly 78 (1971), 385–386. doi:10.1080/00029890.1971.11992769
H. L. Abbott, P. Erdős and D. Hanson, On the number of times an integer occurs as a binomial coefficient, Amer. Math. Monthly 81 (1974), 256–261. doi:10.1080/00029890.1974.11993542
D. M. Kane, Improved bounds on the number of ways of expressing $t$ as a binomial coefficient, Integers 7 (2007), A53. author's copy
K. Matomäki, M. Radziwiłł, X. Shao, T. Tao and J. Teräväinen, Singmaster's conjecture in the interior of Pascal's triangle, Q. J. Math. 73 (2022), 1137–1177. doi:10.1093/qmath/haac006
D. Singmaster, Repeated binomial coefficients and Fibonacci numbers, Fibonacci Quart. 13 (1975), 295–298. doi:10.1080/00150517.1975.12430610

Source

Imported from Erdős Problems 849, curated by Thomas Bloom. Open according to the source as of 2026-10-20. The statement above is written in our own words; see the source for the original wording, history and discussion.