Singmaster's conjecture

(mathematics) A conjecture in combinatorial number theory, stating 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).