470 views

0 votes

There are ten boxes. numbered $1$ to $10$, each containing $g$ gold coins. Each of the coins in nine of these ten boxes weighs $10$ gm, whereas each of the coins in the tenth box weighs $20$ gm. A digital weighing machine is provided. Now, a logician, Mr. Kapil, is invited. The task assigned to him is that he has to find out the box containing the coins weighing $20$ gm each.

If $g = 2$. what is the minimum possible number of times for which the weighing machine is to be used?

- $2$
- $3$
- $5$
- $4$