Question: We are given n identical looking coins, and a seale that allows comparing the weights of two sets of coins ( i . e ,

We are given n identical looking coins, and a seale that allows comparing the weights of two sets of coins (i.e, we can put any number of coins on each side of the scales) We know that there is exactly one fake coin - it is lighter than other coins. Prove that we can discover the fake coin using |~logs(n)~| comparisons.
(Example: When n=3, we can discover the fake coin with one comparison. Take any pair of coins and compare their weight: if their weight is identical, then the third coin is the fake one; and otherwise. one coin is lighter than the other, so it must be fake.)
 We are given n identical looking coins, and a seale that

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!