Singmaster's conjecture
id:
singmaster-s-conjecture-181-10087795
title:
Singmaster's conjecture
text:
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. 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.
brand slug:
wiki
category slug:
encyclopedia
description:
Conjecture in combinatorial number theory
original url:
https://en.wikipedia.org/wiki/Singmaster%27s_conjecture
date created:
2006-03-13T02:34:13Z
date modified:
2024-09-06T00:29:35Z
main entity:
{"identifier":"Q2993335","url":"https://www.wikidata.org/entity/Q2993335"}
image:
fields total:
13
integrity:
15