Editing David Singmaster (section)

==Singmaster's conjecture==
{{Main|Singmaster's conjecture}}
In [[combinatorial number theory]], Singmaster's conjecture states that there is a finite [[upper bound]] on the number of times a number other than 1 can appear in [[Pascal's triangle]]. [[Paul Erdős]] suspected that the conjecture is true, but thought it would probably be very difficult to prove. The [[empirical evidence]] is consistent with the proposition that the smallest upper bound is&nbsp;8.