Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Singmaster's_conjecture> ?p ?o. }
Showing items 1 to 38 of
38
with 100 items per page.
- Singmaster's_conjecture abstract "Singmaster's conjecture is a conjecture in combinatorial number theory in mathematics, 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. Paul Erdős said that Singmaster's conjecture is probably true but he suspected it would be very hard to prove.Let N(a) be the number of times the number a > 1 appears in Pascal's triangle. In big O notation, the conjecture is:".
- Singmaster's_conjecture wikiPageExternalLink h53.pdf.
- Singmaster's_conjecture wikiPageExternalLink singmaster.pdf.
- Singmaster's_conjecture wikiPageID "4374033".
- Singmaster's_conjecture wikiPageRevisionID "594987350".
- Singmaster's_conjecture hasPhotoCollection Singmaster's_conjecture.
- Singmaster's_conjecture subject Category:Combinatorics.
- Singmaster's_conjecture subject Category:Conjectures.
- Singmaster's_conjecture subject Category:Factorial_and_binomial_topics.
- Singmaster's_conjecture subject Category:Number_theory.
- Singmaster's_conjecture subject Category:Triangles_of_numbers.
- Singmaster's_conjecture type Abstraction100002137.
- Singmaster's_conjecture type Attribute100024264.
- Singmaster's_conjecture type Cognition100023271.
- Singmaster's_conjecture type Concept105835747.
- Singmaster's_conjecture type Conjectures.
- Singmaster's_conjecture type Content105809192.
- Singmaster's_conjecture type Figure113862780.
- Singmaster's_conjecture type Hypothesis105888929.
- Singmaster's_conjecture type Idea105833840.
- Singmaster's_conjecture type PlaneFigure113863186.
- Singmaster's_conjecture type Polygon113866144.
- Singmaster's_conjecture type PsychologicalFeature100023100.
- Singmaster's_conjecture type Shape100027807.
- Singmaster's_conjecture type Speculation105891783.
- Singmaster's_conjecture type Triangle113879320.
- Singmaster's_conjecture type TrianglesOfNumbers.
- Singmaster's_conjecture comment "Singmaster's conjecture is a conjecture in combinatorial number theory in mathematics, 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).".
- Singmaster's_conjecture label "Conjecture de Singmaster".
- Singmaster's_conjecture label "Singmaster's conjecture".
- Singmaster's_conjecture label "Гипотеза Сингмастера".
- Singmaster's_conjecture sameAs Conjecture_de_Singmaster.
- Singmaster's_conjecture sameAs m.0bzw0m.
- Singmaster's_conjecture sameAs Q2993335.
- Singmaster's_conjecture sameAs Q2993335.
- Singmaster's_conjecture sameAs Singmaster's_conjecture.
- Singmaster's_conjecture wasDerivedFrom Singmaster's_conjecture?oldid=594987350.
- Singmaster's_conjecture isPrimaryTopicOf Singmaster's_conjecture.