Subcontests
(4)Approximating with sums of subsets of a geometric series
Let n be a positive integer. Let Pn={2n,2n−1⋅3,2n−2⋅32,…,3n}. For each subset X of Pn, we write SX for the sum of all elements of X, with the convention that S∅=0 where ∅ is the empty set. Suppose that y is a real number with 0≤y≤3n+1−2n+1.
Prove that there is a subset Y of Pn such that 0≤y−SY<2n