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.
Decide whether, for every t, some number appears as a binomial coefficient C(n,k) with k ≤ n/2 in exactly t ways.