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 ★★
Poco común · 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).
En Wikipedia
Texto en inglés Aún no hay artículo en tu idioma: extracto en 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: Wikipedia en inglés, CC BY-SA 4.0. ·
Cartas cercanas
-
Conjetura abc
Nº Q306393 ★★★★
Sin ofertas
-
R
Regla de Pascal
Nº Q17099544 ★★
Sin ofertas
-
C
Conjetura de Polignac
Conjetura relacionada con las diferencias entre primos consecutivos
Nº Q1402534 ★
Sin ofertas
-
C
Conjetura de Cramér
Nº Q515591 ★
Sin ofertas
-
Bunkbed conjecture
Conjecture in probabilistic combinatorics
Nº Q124116607 ★
Sin ofertas
-
Teorema de Faltings
Una curva de género mayor que 1 sobre el campo Q de los números racionales tiene solo un número finito de puntos racionales
Nº Q240950 ★
Sin ofertas