Singmaster's conjecture
Singmaster's conjecture proper noun: a conjecture in combinatorial number theory, stating that there is a finite upper bound on the multiplicities of entries in Pascal's triangle (other than the number 1, which appears infinitely many times).
Proper noun
Singmaster's conjecture
- A conjecture in combinatorial number theory, stating that there is a finite upper bound on the multiplicities of entries in Pascal's triangle (other than the number 1, which appears infinitely many times).
Origin of Singmaster's conjecture
Named after the British mathematician David Singmaster, who proposed it in 1971.
Questions about Singmaster's conjecture
- What does Singmaster's conjecture mean?
- Singmaster's conjecture means a conjecture in combinatorial number theory, stating that there is a finite upper bound on the multiplicities of entries in Pascal's triangle (other than the number 1, which appears infinitely many times).
- What part of speech is Singmaster's conjecture?
- Singmaster's conjecture is a proper noun.
Words near Singmaster's conjecture in the dictionary
Source and license
Adapted from Wiktionary: Singmaster's conjecture (page history and authors). Text available under the Creative Commons Attribution-ShareAlike 4.0 license. Word.ws reformatted the entry and added links. Wiktionary data of 2026-09-02.
Last updated:
Cite this entry: “Singmaster's conjecture.” Word.ws, https://word.ws/singmaster%27s_conjecture. Based on Wiktionary, CC BY-SA 4.0.
