I have \(n\) coins one of which is lighter than all the other \((n-1)\) coins. The other \((n-1)\) coins are all of exactly the same mass.

I have to use a weighing balance to find out the light coin.

I am sure that I will only need at most 3 weighings to determine the lighter coin. What is the maximum possible value of \(n\)?

×

Problem Loading...

Note Loading...

Set Loading...