Difference between revisions of "2012 USAMO Problems/Problem 6"
(Created page with "== Problem == For integer <math>n \ge 2</math>, let <math>x_1</math>, <math>x_2</math>, <math>\dots</math>, <math>x_n</math> be real numbers satisfying <cmath>x_1 + x_2 + \dots ...") |
(No difference)
|
Revision as of 17:55, 25 April 2012
Problem
For integer , let , , , be real numbers satisfying For each subset , define (If is the empty set, then .)
Prove that for any positive number , the number of sets satisfying is at most . For what choices of , , \dots, , does equality hold?