A difficult and tricky problem

  • Thread starter Thread starter agnibho
  • Start date Start date
AI Thread Summary
The problem involves dividing 15 coins, with 5 heads and 10 tails, into two groups with an equal number of heads facing up, without flipping any coins. Initial thoughts suggest it may be impossible due to the odd number of heads, but the question indicates a solution exists. Some participants speculate that a trick might be involved, possibly related to the phrasing of the problem or the blindfold condition. Suggestions include arranging the coins in a way that maintains their orientation or covering one head with a tails-up coin. The discussion emphasizes the challenge of finding a solution despite the apparent contradictions in the problem.
agnibho
Messages
46
Reaction score
0

Homework Statement


You've 15 coins out of which 5 coins are turned with their HEAD facing upwards and the rest 10 have their TAILS facing upwards. Suppose you have been blindfolded. Now you've got to divide these 15 coins in two groups such that each group has the same number of coins have their HEADs facing up. But you cannot overturn any coin. How can you do it?? It may seem practically impossible but it can be really done!
2. The attempt at a solution
I thought it might be a problem of probability. I found the probability of HEAD which is 1/15 i.e. 1/3 which means one out of three. But actually I think it is impossible as to the fact that the number of HEADs is odd and we can't divide it into two equal groups! But in the question it says that it can be done! I suppose there must be some trick in it. Please help me.
 
Last edited:
Physics news on Phys.org
agnibho said:

Homework Statement


You've 15 coins out of which 5 coins are turned with their HEAD facing upwards and the rest 15 have their TAILS facing upwards. Suppose you have been blindfolded. Now you've got to divide these 15 coins in two groups such that each group has the same number of coins have their HEADs facing up. But you cannot overturn any coin. How can you do it?? It may seem practically impossible but it can be really done!
2. The attempt at a solution
I thought it might be a problem of probability. I found the probability of HEAD which is 1/15 i.e. 1/3 which means one out of three. But actually I think it is impossible as to the fact that the number of HEADs is odd and we can't divide it into two equal groups! But in the question it says that it can be done! I suppose there must be some trick in it. Please help me.

Sorry to say but one difficulty is that if there is a trick in the question, it could easily be hidden in the less than perfect English used to supply the information here.

Perhaps you divide the coins into two groups, of any size you like, but arrange the coins on edge, to form a couple of "cylinders". That way you have not overturned and coin, just stood all of them on edge??
 
Last edited:
Suppose you have been blindfolded.

I can't see why it is specified that you be blindfolded.

15 coins? So maybe you cover over one of the heads with a tails-up coin?
 
I picked up this problem from the Schaum's series book titled "College Mathematics" by Ayres/Schmidt. It is a solved problem in the book. But what surprised me was that the solution to this problem was given in one line without any explanation. I could, therefore, not understand how the given one-line solution was reached. The one-line solution in the book says: The equation is ##x \cos{\omega} +y \sin{\omega} - 5 = 0##, ##\omega## being the parameter. From my side, the only thing I could...
Essentially I just have this problem that I'm stuck on, on a sheet about complex numbers: Show that, for ##|r|<1,## $$1+r\cos(x)+r^2\cos(2x)+r^3\cos(3x)...=\frac{1-r\cos(x)}{1-2r\cos(x)+r^2}$$ My first thought was to express it as a geometric series, where the real part of the sum of the series would be the series you see above: $$1+re^{ix}+r^2e^{2ix}+r^3e^{3ix}...$$ The sum of this series is just: $$\frac{(re^{ix})^n-1}{re^{ix} - 1}$$ I'm having some trouble trying to figure out what to...
Back
Top