olymmath

Putnam 1989 B4

  • Session B

Can a countably infinite set have an uncountable collection of non-empty subsets such that the intersection of any two of them is finite?

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/1989/b4 · Tag 9A4CJX7ZG0 · Edit this page on GitHub · Keys: j next, k previous