olymmath

Putnam 1956 A5

  • Session A

Call a subset of {1,2,…,n}\{1,2,\ldots, n\} unfriendly if no two of its elements are consecutive. Show that the number of unfriendly subsets with kk elements is (n−k+1k).\binom{n-k+1}{k}.

Dataset text AI-MO AoPS. Quoted with source.

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Similar problems

These problems have the most words in common with this statement.

Locator putnam/1956/a5 · Tag DDCMMWB454 · Edit this page on GitHub · Keys: j next, k previous