Weighing the Coin Problem (PENDING)
This is amongst the simplest problems to say, easiest to approach and yet somehow unsolvable at times.
Weighing the Coin Problem (PENDING)
1. Problem Statement
You are given \(N\) coins and one of them weighs differently than the rest, either heavier or lighter. Your task is to find which one it is. You are to use a weighing balance. Note that you can put as many coins on either side of the balance. Find the minimum number of weighing operations required to find the odd coin.
A weighing balance
2. Solution
Before tackling the general case, let us start progressly from smaller \(N\).
Notes
This post is licensed under CC BY 4.0 by the author.