Can you find the fake coin?

A Kaboobly Dooist gives you 8 coins.

He tells you that exactly one of the 8 coins is counterfeit and that the counterfeit coin is heavier .

He then gives you a beam balance and an User Manual. You have never seen a beam balance before, so you open the user manual and find that it says:

You can place a coin or a group of coins on the two pans of the balance. You can find which side is heavier, if any or if their weights are equal.

What is the minimum number of times you need to use the balance to surely find the counterfeit coin?

log 3 8 \left \lceil \log _3 8 \right \rceil 2 8 2^8 ( 8 3 ) {8 \choose 3} ( 8 2 ) {8 \choose 2}

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

I believe the option should be log 3 8 \lceil \log_38\rceil , and not log 3 8 \log_3\lceil8\rceil , as the latter is meaningless.

Basically, given n n weights with 1 1 counterfeit weight, either heavier or lighter, it takes log 3 n \lceil \log_3n\rceil weighings to determine the counterfeit coin. The process is to split the coins into almost equal groups of 3 3 , and weigh two groups at a time. This way, in one weighing, the number of coins required to be examined is reduced by 2 3 \frac{2}{3} . Repeating this procedure will lead you to single out one coin in the least number of steps.

Also, to generalize, if the scale could compare k k groups of coins at once, then the coins must be split into k + 1 k+1 groups, and the number of weighings will be log k + 1 n \lceil \log_{k+1}n\rceil

I have updated the correct answer to log 3 8 \lceil \log_3 8 \rceil .

No one was marked wrong.

Calvin Lin Staff - 6 years, 8 months ago

You're very correct about Ceiling (Log_3(8)). Sorry for putting it the wrong way

Agnishom Chattopadhyay - 6 years, 8 months ago

Log in to reply

nice question

math man - 6 years, 8 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...