You are given a torch and 6 cells. The torch runs on 3 charged cells. Out of the given 6 cells, 3 cells are charged and other 3 are uncharged but you don't know which one is charged and which one is uncharged. What is the least number of attempts you need to make, to ensure it will light up the torch ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
There are 3 charged cells out of 6 cells given and we have to get that all the charged cells since there is no option of leaving any charged cells means there are no more than the required number of charged cells, we have to attempt all the combination of selecting 3 cells at a time and considering the worst case the last selection will lit the torch. So the answer is ( 3 6 ) = 2 0
In fact I believe that if there are n cells given and m ≤ n cells are charged and the torch uses m cells to light up then the least number of attempts to lit the torch is ( m n ) . I don't know whether this hypothesis is true or not. If it is true I am not able to prove it.