Singmaster's conjecture
Conjecture in combinatorial number theory
Singmaster's conjecture is a conjecture in combinatorial number theory, named after the British mathematician David Singmaster who proposed it in 1971. It says 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).
Nº Q2993335 ★★
Incomum · Saberes
Singmaster's conjecture
Conjecture in combinatorial number theory
Singmaster's conjecture is a conjecture in combinatorial number theory, named after the British mathematician David Singmaster who proposed it in 1971. It says 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).
Na Wikipédia
Texto em inglês Ainda não há artigo no seu idioma: trecho em inglês.
Singmaster's conjecture is a conjecture in combinatorial number theory, named after the British mathematician David Singmaster who proposed it in 1971. It says 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). It is clear that the only number that appears infinitely many times in Pascal's triangle is 1, because any other number x can appear only within the first x + 1 rows of the triangle.
Texto: Wikipédia em inglês, CC BY-SA 4.0. ·
Cartas próximas
-
Conjetura Oesterlé–Masser
Nº Q306393 ★★★★
Sem ofertas
-
R
Relação de Stifel
Nº Q17099544 ★★
Sem ofertas
-
P
Polignac's conjecture
Conjecture in number theory involving prime gaps
Nº Q1402534 ★
Sem ofertas
-
c
conjectura de Cramer
Conjecture
Nº Q515591 ★
Sem ofertas
-
Bunkbed conjecture
Conjecture in probabilistic combinatorics
Nº Q124116607 ★
Sem ofertas
-
teorema de Faltings
Theorem
Nº Q240950 ★
Sem ofertas