olymmath

Putnam 1990 A6

  • Session A

If XX is a finite set, let XX denote the number of elements in XX. Call an ordered pair (S,T)(S, T) of subsets of {1,2,…,n}\{1, 2, \dots, n\} admissible if s>∣T∣s > |T| for each s∈Ss \in S, and t>∣S∣t > |S| for each t∈Tt \in T. How many admissible ordered pairs of subsets of {1,2,…,10}\{1, 2, \dots, 10\} are there? Prove your answer.

Curated text Kedlaya Putnam archive. 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/1990/a6 · Tag B1EA28XCDP · Edit this page on GitHub · Keys: j next, k previous