Beam Balance Strikes Back

You have 6 coins of distinct weights and a beam balance with two pans. You devise an algorithm that identifies the second lightest coin with complete certainty with at most \(M\) weighings.

What is the minimum possible value of \(M?\)


Consider trying this problem first.

×

Problem Loading...

Note Loading...

Set Loading...