AN INTEGER IS RANDOMLY SELECTED AND PERMANENTLY REMOVED FROM THE SET OF 100 INTEGERS (1,2,3,...100). WHAT IS THE MINIMUM NUMBER OF TIMES THIS REMOVAL PROCEDURE WILL HAVE TO BE DONE TO GUARANTEE THAT AN INTEGER HAS BEEN REMOVED?
SRRY I MEANT AN EVEN INTEGER HAS BEEN REMOVED LOL
You may have to clarify, do you mean how many times will this have to be done to guarantee the removal of an even or odd integer? Because just removing one integer guarantees the removal of an integer.
In either case though, you have to think. How many even or odd numbers are there between 1-100? The answer is 50. So in order to guarantee the removal of an even number 51 integers must be randomly removed.
I MEAN AN EVEN SORRY!
To guarantee that an integer has been removed, we need to continue the removal procedure until there is only one integer left in the set.
At the beginning, we have a set of 100 integers. We can think of each removal as eliminating one of the integers. If we remove an integer, the size of the set decreases by 1.
So, to guarantee that an integer has been removed, we need to remove a total of 99 integers (to have just one left).
Therefore, the minimum number of times the removal procedure needs to be done is 99.