This is a helper problem that might help you to solve the Poisoned Sherbet Puzzle posted a couple of days ago.
So Solve this one first and then solve that puzzle.
Suppose you have eight gold coins, One of them is slightly heavier, but the only way to tell is by putting it on a scale against the others. What’s the fewest number of times you’d have to use the scale to find the heavier coin?