olymmath

Putnam 1996 B1

  • Session B

Define a selfish set to be a set which has its own cardinality (number of elements) as an element. Find, with proof, the number of subsets of {1,2,…,n}\{1, 2, \ldots, n\} which are minimal selfish sets, that is, selfish sets none of whose proper subsets is selfish.

Curated text Kedlaya Putnam archive. Quoted with source.

Solutions

Human solution Solution 1 by Manjul Bhargava and Kiran Kedlaya

The terms of the source let olymmath link to this solution but not copy it. Read the solution (Kedlaya Putnam archive).

Similar problems

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

Locator putnam/1996/b1 · Tag X8VMVTYFQ6 · Edit this page on GitHub · Keys: j next, k previous