You are not logged in.
Pages: 1
Excellent discussion. But how about suggesting the reword og the problem to make it a feasible one? May be accepring the condition of possible use of three stalls by each child and no limitation of collective stall use as alredy proposed here by "a solver".
Thanks for your precision. I already recomposed the text to make it more clear, according to your advice.
Gondia is a small island and country somewhere. The monetary unit of Gondia is the Parrot. The current coinage of Gondia includes coins of 20, 10, 5, 2.5, 1, 0.5, 0.2 and 0.1 Parrots. How many possibilities do exist to compose a total amount of 100 Parrots using 100 coins but without coins of 1 Parrot? And if not excluding coins of 1 Parrot?
Not at all questioning the solution of (7/3)'. Only giving an hint about a variation of the hats puzzle, that normally is not presented or discussed because much more obvious.
This solution is the logical approach to a sequencial display: each candidate can only regard who is in front of him and the solution is found from the information he gets from precedent speaker. A rather different situation is when the three candidates are placed in triangle and each one can see what colour have the hats of the two other competitors, but not the colour of his hat. In that case two alternatives only exist and are immediate: or all the three cannot conclude or one and only one of them seeing two white hats in the others heads immediately concludes that he has a black hat - with no need of logical reasoning at all!
Happy to find this forum but somewhat unhappy to find it so late. Best regards to all.
Pages: 1