You have 25 coins, and there is exactly one fake coin which is lighter than each of the others (which have equal weight).
Using only a balance scale, what is the fewest number of weighings you would need to make to
ensure
that you can determine the fake coin?
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.
Thanks for formulating the problem.
I was one of the 73% who got this wrong but I always learn more from getting a problem wrong than getting it right! This made me question why most of us got it wrong. I think everyone got the concept of making two equal piles of coins for the balance and then having a remainder pile. But those of us who got it wrong maximised the number of coins on the balance. That is, we divided them as 12, 12 and 1. This is making the problem binary. The key is to maximise all three piles, but keep more coins in the piles on the balance. In this case, you need 9, 9 and 7, as has been stated. When you reach 9, 9 and 9, or 27 coins, you have reached the limit of 3 weighings and need to go to four. If you go back to the simpler cases, 3 coins is the maximum for one weighing, 9 coins is the maximum for 2 weighings, and so on. So you can extrapolate the general formula from this: 3^n, where n is the number of weighings.
Let me add and addendum to my previous comment. I made one incorrect statement. The piles of coins on the balance don't have to be larger than the remainder pile. They are in this case. But in the case of 28, we get 9,9,10. If the fake coin is on the balance we still get it in 3 weighings, but if it is in the remainder it may take 4.
Ooops ... I read that one coin was different but missed that it was lighter. Then I got 4 as an answer. This is a different problem all together ;-)
minimum number is one because if you split the coins into two sets of twelve and they are equally balanced the single remaining coin is the fake
minimum is 2
[Weigh 1] You divide 27 coins to 3 groups, each group consists of 9 coins. There are group A, B and C. You weigh group A and B. If they balance, group C has the fake coin. If not, you know which has the fake coin.
[Weigh 2] Let's take the group with the fake coin. You divide it to 3 groups of 3. Group A, B and C. You weigh group A and B. If they balance, group C has the fake coin. If not, you know which has the fake coin.
[Weigh 3] You can repeat the steps above
*pardon my english
The problem said start with 25 coins. Where did you get 27 from?
I believe this question evolved from the original one which would only involves 8-9 coins. Nevertheless, the answers follow the same pattern: You'd divide the coins into a number of groups so that 1 weight immediately derives the group that has the fake coin. The answer is 3 groups: weight 2 groups and left out 1 group. If 2 weighted groups are balance, the left-out one is the one, otherwise whichever lighter group on the scale.
Applying that to this question: 25 = 8/8/9 -> 9 (worst case we have 9) = 3/3/3 -> 3 = 1/1/1. Answer: 3 times.
If I understand the question correctly "what is the FEWEST number of weightings needed to determine fake coin", isn't the fewest just a single weighing?
If I take 25 coins, split into 2 groups of 12 with one coin left over, and weigh the two groups of twelve - if both groups of 12 weigh the same, I have determined that the left over coin is the fake one. Otherwise I have to find the fake coin in the light group of 12 coins, but it can be done in 1 weighing. What am I not understanding about the question?
Log in to reply
The question says to ensure we know which is lighter, if the lighter coin is in the group of 12 you don't know after 1.
So whilst it is possible after 1, it's not always possible so can't be ensured
My Answer is 5 so: two groups of 12 weigh and put aside the heavier group. Next weigh two groups of six put aside the heavier group and we are left with 6 divide into two groups of 3 and weigh put aside the heavier group we now have weighed 3 times and now we have to weigh 3 coins? not possible until we reintroduce the first coin kept aside so making four coins. Next weigh the 2 coins on either side and put aside the heaviest coins we are left with 2 coins. So we have weighed the 4th time and now weigh the 2 coins and whichever is the lighter is the answer for weighing 5 times.
Log in to reply
Using your method produces 4 trials: 1) 12/12 is equal so the 25th coin is the fake or 12/12 is unequal, which means you then weigh the lighter twelve as follows 2) 6/6 has to be unequal; keep the lighter 3) 3/3 and keep the lighter 4) 1/1 with the third coin withheld; if even weighted, the third coin is fake. If not, the lighter is fake.
The worst case is not the 9, it is the 8:
8/8/9 -> 8=4/4 -> 4=2/2 -> 2=1/1
The answer should be 4
Log in to reply
You don't split the 8 into four and four:
8=3/2/3
If the plates balance, then just weigh the remaining two. If the plates don't balance, then split 3 into 1/1/1
The original version I saw had 12 coins, but you didn't know if the fake was lighter or heavier. You can do this in 3 weighings.
It's actually simple we need 3 coins min. 1 will have different weight than the other 2 so that's the fake.
Weigh 12 coins in each pan if they balance, you have the light coin in your hand. I agree, that the chances of having only heavy coins in this first weighing are very slim, there is a chance that one weighing could determine which coin is the light one
Exactly! Forget the math for a moment and focus on the English. The question states, "what is the fewest number of weighings you would need to make to ensure that you can determine the fake coin?" Well, the FEWEST is the one measurement mentioned above. Given that you are already told that there exists exactly one fake coin which is lighter than the rest, there is no need to do all of the additional confirmations.
Of course not! they ask to "ensure" so it has to be the minimal number of weighing that will ALWAYS result in finding the fake coin not only if you are super lucky the first time!!
I do agree
I'm glad that I wasn't the only one who thought about this possibility.
Good to see this discussion! A good follow on would have been the odds for that "1 weighing result"! Anyone?
Please write these problems correctly The phrase "" the fewest weighings you can make."" means what is the least amount of weighings possible """.
Now, It is certainly possible for me to choose a coin at random and separate it from the rest.
Then I split the remaining 24 into 2 groups of 12.
It is certainly possible that both groups weigh the same. Which would mean that I have the lighter coin in my hand.
This means that the least amount of weighings possible is 1 !!! Not 3 !!!
I had to choose the "" try again """option just to write this correction.. Which was totally uncalled for. !!
It's least number of weighings to be SURE of finding the fake coin.
Log in to reply
If My 12 coins in each side balance I can be SURE that I have the light coin in my hand.
So you can be SURE before you start!
I think of it as "What's the 'most' number of weighings one should ever have to make". or, using the best possible method for finding it, what's your worst case scenario. I understood the meaning, but don't like the way they worded it.
Yeah you're ignore the word "ensure". With your method you could get lucky, but getting lucky one in 25 tries doesn't ensure a solution that will work 25/25 times with a single weighing.
UUUUUGGGGHHHHAAAARRREEE Y'ALL KIDDING ME!?!?! If one coin is fake, and weighs less than the other 24 equally weighted coins, It might prove useful to use a formula that you learned in HS or college algebra to determine the mean, or maximum number of weighs. But, simplicity, my fellow scholars, is bliss. If the fake one weighs less than ALL the others, if you grab the first two coins, place each on an opposite plate of the balance, and one side drops down,,,,,,,,, Then the one what bees higher dan dat utter 1 IS THE FAKE ONE!!!! Minimum number of weighs: ONE!
It is convenient to split the number of coins in 3 because in that way you can also use the information coming from the fact that the two plates of the scales are in balance. Of course, on each plate must go the same number of coins.
In our case, with 25 coins:
1st weighing) Divide 25 in three groups of 9, 8 and 8 and put on the plates the two groups of 8. If the plates are balanced then the fake coin is in the group of 9, otherwise it is in the lighter group of 8.
2nd weighing - 9 coins) If the fake coin is in the group of 9, divide this in 3 groups of 3 and weigh two of them. Again, if the plates are balanced then the fake coin is in the group left out, otherwise it is in the lighter of the two which have been weighed.
2nd weighing - 8 coins) If the fake coin is in the group of 8, divide this in one group of 2 and two of 3 and weigh these. If the plates are balanced then the fake coin is in the group of 2, otherwise it is in the lighter of the two groups of 3.
3rd weighing - 3 coins) When you have a group of 3 coins, weigh two of them. Then, if the plates are balanced the fake coin is the one left out otherwise is the lighter one of the two which have been weighed.
3rd weighing - 2 coins) When you are left with 2 coins just weigh them and determine the lighter one.
Therefore, we just need 3 measures.
I got two weighings. Someone correct my logic if I'm wrong.
I'm working on the assumption I got lucky and found the coin, or I already know the coin is lighter and I want to confirm.
Separate the coins into five groups of five coins. AAAAa BBBBB CCCCC DDDDD EEEEE. Select the A and B group and weigh them. (AAAAa) <> (BBBBB), and find the A group is lighter. Discard B group. Remove the 'a' coin from the A group and weigh two groups of two coins (AA) <> (AA), and find they're equal. The 'a' coin left out is lighter.
What's the logic? To get lucky? Then why not divide the coins in 25 group A, B, C, D, etc of one coin each and get even more lucky and pick the lighter coin at the first wheight? Actually you don't even need to get more lucky since the chance to pic one coin out of 25 it's in the same ballpark of picking the right coin out of five but twice in a row. :)
Take aside one coin. Weight two groups of 12. If they weigh the same, then the one you took aside was the fake. So one measurement is the minimum that would ensure that you had found the fake.
The goal isn't to find the minimum possible of all scenarios, it's to find the minimum possible to ENSURE you find the light coin. You could get lucky and find the single left out coin is it, but if it's not then you still have other coins to verify. You must test all coins in a clever way to be sure you can find it every single time.
Answer:3 Since total number of coins (25) is less then or equal to 3 power number of times (3). ie. 25<=3^3.
In every weight there are 3 possible outcomes: balanced, left, right. This is the information we can get from each experience.
The problem is similar to binary search where one successively divides an interval in half until the correct result is found. In our case we divide it in 3.
On average we need lo g 3 ( 2 5 ) ≈ 2 . 9 2 9 9 weightings, and can guarantee a maximum of 3 weightings.
Picking a small nit regarding the wording in the problem: "fewest weighings... to ensure that you can determine the fake coin?"
I'd say the answer to that question is zero. I can state with certainty, without actually performing any weighings, that I could determine the fake coin by performing weighings if I wanted to.
Removing "ensure that you can" would more clearly indicate what the puzzle intends me to work out.
Creo que en el mejor caso bastaría pesar una sola vez. 12 y 12, y suponer que la falsa queda afuera.
While I got this correct on the first attempt, the truth is a person could get really lucky and find the lighter coin with only a single weighing. Seeing as this had 25 coins, one could put 12 on each side of the scale, if the scale balanced then the one coin that was not on the scale would have been the light one. However, if it did not balance then it would take the 3 tries that was the answer to this question, as you would have to split the lighter stack on each side of the scale as you progressively reduced the possibilities until you had 3 coins, which again on the third attempt if the scale balanced the one left out would be the lightest, if not then it would be obvious which side of the scale the lighter coin was placed on.
Gary, Are you sure your solution works? I think what you're describing is four weighings, not three. I think you're saying: 1) Weigh twelve on each side. 2) Weigh six on each side. 3) Weigh three on each side. 4) Weigh one on each side.
– Mike Trutt · now reply edit
W/g mnie te 3 wazenia to za dużo. Wystarczy jedno wazenie.Ale niech Wam będzie że 3.
I think 1 try is pretty possible
The goal isn't to find the minimum possible of all scenarios, it's to find the minimum possible to ENSURE you find the light coin. You could get lucky and find the single left out coin is it, but if it's not then you still have other coins to verify. You must test all coins in a clever way to be sure you can find it every single time.
Problem Loading...
Note Loading...
Set Loading...
Suppose there were 27 coins.
We can split them into 3 groups of 9.
We weigh two groups of 9 with each other.
If they are equal, split the last group of 9 into 3 groups of 3, ...
We can easily keep splitting them in groups of 3 until we have found the coin.
This takes n weighings, such that 3 n is the number of coins.
Now lets go to 25 coins.
We can divide the 25 coins into 2 groups of 9 coins, and 1 group of 7.
Measure the 2 groups of 9 against each other.
If equal, go to a).
If not, go to b)
a) split last group of 7 into 2 groups of 3, and 1 group of 1, and weigh the two groups of 3 together. If equal, the last coin remaining is fake, and if different, take the fake group of 3, and weigh two coins against each other.
b) split 9 into 3, 3 and 3. Weigh two groups of 3 together. If equal, take last group of 3, and if different, take lighter group of 3. With the group of 3, measure two of the coins against each other.
We can say that if k is the number of coins, the number of weighings it takes is n, such that 3 n − 1 < k < or equal to 3 n