olymmath

Putnam 1964 B2

  • Session B

Let SS be a set of n>0n>0 elements, and let A1,A2,…AkA_1 , A_2 , \ldots A_k be a family of distinct subsets such that any two have a non-empty intersection. Assume that no other subset of SS intersects all of the Ai.A_i. Prove that k=2n−1.k=2^{n-1}.

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/1964/b2 · Tag HYC90DPFXT · Edit this page on GitHub · Keys: j next, k previous