A jar contains 100 white jellybeans, 50 yellow jellybeans and 20 green jellybeans. Jason is blindfolded; he wants to get at least 1 green jellybean. Assuming that each jellybean he removes is randomly chosen, how many must he remove in order to ensure that he gets at least 1 green jelly bean?
151
The first 150 may have bee all white/yellow.
To ensure that Jason gets at least 1 green jellybean, we need to consider the worst-case scenario.
The worst-case scenario is when Jason removes all the white and yellow jellybeans before getting a green jellybean.
So, let's calculate the minimum number of jellybeans he needs to remove.
First, let's find out the total number of white and yellow jellybeans:
100 white jellybeans + 50 yellow jellybeans = 150 white and yellow jellybeans.
Since Jason needs to remove all these white and yellow jellybeans before he can guarantee getting a green jellybean, he needs to remove a minimum of 150 jellybeans.
Therefore, Jason must remove at least 150 jellybeans to ensure that he gets at least 1 green jellybean.