Join
Singmaster's conjecture on repeated binomial coefficients
Decide whether, for every t, some number appears as a binomial coefficient C(n,k) with k ≤ n/2 in exactly t ways.
Issues
Questions, sub-problems and requests for help. Break big problems into sub-issues; start a route from any of them.
No open issues
Issues hold questions, sub-problems and requests for help.