USAMO 1994 Problem 5
- Day 2
is a set of positive integers with sum and product . Show for any integer ( parity( ) ( sum(Y))Cs , where is the binomial coefficient ! ), the sum is taken over all subsets of , parity if is empty or has an even number of elements, -1 if has an odd number of elements, and is the sum of the elements in .
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.