Erdős Problem #849 — Prescribed multiplicities of binomial coefficients
For an integer , let be the number of integer pairs satisfying , , and ; equivalently,
Is it true that for every integer there is an integer such that ? Since all the binomial coefficients in this range are positive, any such must be positive. Erdős Problems #849
Background
This is a multiplicity question for entries of Pascal’s triangle, with the symmetry removed by restricting to . The problem record attributes the question to Erdős and Gordon, who had considered it “many years” earlier, and identifies it with Singmaster’s conjecture. The examples and give multiplicities three and four, respectively, in this half-triangle convention. Erdős Problems #849 Erdős, Some problems I presented or planned to present in my shorttalk (1996)
The motivating expectation behind Singmaster’s conjecture is that multiplicities should be bounded by an absolute constant, which would rule out the proposed examples for every . The question asks for the stronger opposite phenomenon: whether every positive multiplicity occurs. In the cited account, no example with multiplicity at least five is recorded. Erdős Problems #849
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.