Solution
Understanding the set :-
This is a minima maxima + quantitative set :
Here you have 100 boxes and a mystery prices in every box, named as a, b, c...
Also, it is given that, there is price of item a is highest , then prices b, then price c, and so on...
Price a - a diamond ring is only in one of the box,
and other prices are atleast double in quantity of previous item i.e.,
we know item a is only 1 , then item b will be atleast two and item c will again be atleast double of item b.
Now, lets try to solve the set with the given information -
We want to minimize types of prizes :
We know there can be different types of prizes as - a, b, c,...
But since we need to minimize it we will try to have just one item firstly, but we know that -
1st item i.e., a - is a diamond ring which is only in one box.
Therefore, we will try with two items - a and b
In this case - a - a diamond ring will be in one of the box
and b - which atleast doubles - is in rest of the 99 boxes
=> minimum there will be 2 boxes.
More from this set:
Question 11