New Batches at TathaGat !!!               Directions to CP centre
please explaim this question
by Rahul Jain - Sunday, 27 May 2012, 08:25 AM

There are m blue vessels with known volumes v

1, v2,.... vm, arranged in ascending order of volume, where v1 >

0.5 litre, and  vm<1 litre.

Each of these is full of water initially. The water from each of these is emptied into a

minimum number of empty white vessels, each having volume 1 litre. The water from a blue vessel is not

emptied into a white vessel unless the white vessels has enough empty volume to hold all the water of the blue

vessel. The number of white vessels required to empty all the blue vessels according to the above rules was n.


1). Among the four values given below, which is the least upper bound on e, where e is the total empty volume in the n white vessels

at the end of the above process?

(1) mv

m (2) m(1 – vm) (3) mv1 (4) m(1 – v1)


2)Let the number of white vessels needed be n

1 for the emptying process described above, if the volume of each white vessel is

2 litres. Among the following values, which is the least upper bound on n


(2) smallest integer greater than or equal to

3) n

(4) greater integer less than or equal to