# Singmaster’s conjecture

Conjecture. (David Singmaster). With the exception of the number 1, no positive integer appears in Pascal’s triangle more than twelve times.

Numbering the top row of Pascal’s triangle (the tip with the single instance of 1) as row 0, and leftmost column as row 0, it is clear that each integer $n>2$ occurs at least twice, specifically, at positions $(n,1)$ and $(n,n-1)$. Singmaster was able to figure out that when there is a solution to

$$n=\left(\genfrac{}{}{0pt}{}{{F}_{2k}{F}_{2k+1}}{{F}_{2k-1}{F}_{2k}-1}\right)-1=\left(\genfrac{}{}{0pt}{}{{F}_{2k}{F}_{2k+1}-1}{{F}_{2k-1}{F}_{2k}}\right)$$ |

(with ${F}_{i}$ being the $i$th Fibonacci number^{}) the number $n$ occurs six times in Pascal’s triangle, and he showed that there are infinitely many such numbers. Empirical evidence suggests the actual maximum of instances for a number to occur in Pascal’s triangle may be less than twelve: Pascal’s triangle has been computed to millions of rows and no number (besides 1) has been encountered more than eight times.

Title | Singmaster’s conjecture |
---|---|

Canonical name | SingmastersConjecture |

Date of creation | 2013-03-22 18:51:10 |

Last modified on | 2013-03-22 18:51:10 |

Owner | PrimeFan (13766) |

Last modified by | PrimeFan (13766) |

Numerical id | 4 |

Author | PrimeFan (13766) |

Entry type | Conjecture |

Classification | msc 05A10 |