US-TST 2010 Problem 6
Let be a finite set of positive integers greater than 1. A subset of is called good if for every there exists some with . Prove that the number of good subsets of is odd.
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.
Similar problems
These problems have the most words in common with this statement.