USAMO 1979 Problem 5
- Day 2
has members. Given subsets of , each with 3 members, show that we can always find two which have just one member in common.
Dataset text NuminaMath olympiads. 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.