Question 1: How many subsets of *are there such that their elements' sum exceeds * ?
Solution: Thus for each subset whose elements sum to more than , there is another subset (namely , the set with all the elements of minus all the elements in ). There are subsets of , so there are subsets that satisfy the property.
Question 2: How many subsets of are there such that their elements' sum exceeds * *, with ?
This question is significantly harder as the symmetry argument made in the first question won't hold in the majority of cases.
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
(Link to source of question 1: http://www.imomath.com/index.php?options=238&lmm=1, where bijections are used in the proof more formally).