Design an algorithm to find the fake coin in the fewest number of weighings. How many times must you use the scale? Finding the Fake Coin. We have been. www.cs.uni.edu › ~wallingf › teaching › sessions › session17. Divide and conquer algorithm. Generalization Suppose you have a three pan balance. Then one can find the fake coin out of k coins by m weighings if 4 m−1.
-