There are 10 boxes, of 10 balls in each of the box. Each ball weigh . Now for instance, Any one of the box is replaced with another box, of each 10 balls, where each ball weigh instead . You have one electronic machine.
Find out how many number of trails you need to find which box contains balls.
Clarifications :
Taking a box is counted as a trail (eg. taking 2 boxes means 2 trails)
Taking balls from any boxes is counted as a trail (eg. taking 1 ball from first box, 5 balls from last box means 1 trail only)
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.
Let boxes with 9g and 10g totally be represented as B o x 1 , B o x 2 , … , B o x 1 0 Now, take 1 ball from B o x 1 , 2 balls from B o x 2 , and similarly until B o x 1 0 . Now sum the weights of all the balls, let it be x
Now, assuming all the balls as 10g, the total weight would be, Total no of balls × 1 0 g = ( 1 + 2 + 3 + … + 1 0 ) × 1 0 = 5 0 ∗ 1 0 = 5 0 0 g .
Now, weight of x is lesser than 500g, as weight of x have one 9g in it. So, now let's subtract 500 and x . Compare the result, if the result is lesser than 1, then the box from which one ball is taken have 9g (ie, B o x 1 ), if the result is lesser than 2, then the box from which two ball is taken have 9g (ie, B o x 2 ), etc...
So you can easily find it in a trail