Question 153
There are $n \geq 2$ coins, each with a different positive integer value. Call an integer $m$ sticky if some subset of these $n$ coins have total value $m$. We call the entire set of coins a stick if all the sticky numbers form a consecutive range of integers. Compute the minimum total value of a stick across all sticks containing a coin of value $100$.