加入
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.
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
Decide whether, for every t, some number appears as a binomial coefficient C(n,k) with k ≤ n/2 in exactly t ways.
PR 把工作从一条路线带到另一条；合并它就是采纳。