# 2012 USAMO Problems/Problem 6

## 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?