Question 85
Bob has the collection of $n$ coins. Each of them weights an integer number of grams, and their total weight is equal to 300 grams.
Find the smallest possible value of $n$ for which Bob always (independently of coin's weights) can partition his collection into three groups so that the total weight the coins in each of the groups is equal to 100 grams.
Find the smallest possible value of $n$ for which Bob always (independently of coin's weights) can partition his collection into three groups so that the total weight the coins in each of the groups is equal to 100 grams.