The following problem is lightly adapted from AoPS.
You have 30 coins of identical appearance but distinct weights. You have only a balance that can rank exactly 5 coins from lightest to heaviest. What is the minimum number of weighings needed to determine the second-lightest coin?
The AoPS post's comments claim that the answer is 8, but the scheme presented actually finds the lightest coin. I have a gut feeling the answer is 10 – each weighing eliminates at most 3 coins from being the second-lightest – but does this reasoning also rule out a scheme with 9 weighings?
