A convention is held where all the big logicians are summoned. The master places a band on everyone's forehead. Now all of them can see others bands but can't see his own. Then they are told that there are different colours of bands. All the logicians sit in circle and they are further explained that a bell will ring at regular intervals. The moment when a logician knew the colour of band on his forehead, he will leave at the next bell. If anyone leaves at the wrong bell, he will be disqualified.
The master assures the logicians that the puzzle will not be impossible for anyone of them. How will the logicians manage ?
Assume the given figure to be a delicious doughnut. Yes, now you can concentrate more on the puzzle. So you have this delicious doughnut in your refrigerator when your friends come knocking at the door. There are eight of them. Now you have to make three cuts in this doughnut so that each one of you nine people can enjoy a piece of it. Neither you nor your friends would mind the size of their piece as long as they are getting it. How will you do it?
In a box, there is a jumble of 7 red balls, 6 blue balls, 5 green balls, and 4 yellow balls. What is the minimum number of balls, will you have to pick up so that you have at least 4 balls of the same colour?
Two friends were stuck in a cottage. They had nothing to do and thus they started playing cards. Suddenly the power went off and Friend 1 inverted the position of 15 cards in the normal deck of 52 cards and shuffled it. Now he asked Friend 2 to divide the cards into two piles (need not be equal) with equal number of cards facing up. The room was quite dark and Friend 2 could not see the cards. He thinks for a while and then divides the cards in two piles.
On checking, the count of cards facing up is same in both the piles. How could Friend 2 have done it ?
Suppose we lay down two cups in front of you. One of the cups is filled with tea and the other one with coffee. Now we ask you to take a spoonful of tea and mix it with the coffee. At this moment, the coffee cup has a mixture of tea and coffee. You have to take that mixture (spoonful) and add it back to the tea.
Can you now tell if the cup of coffee has more tea or the cup of tea has more coffee?
Steffi's daughter Jazelle needs to be picked up from school every day.
Steffi asks one of her colleagues to pick up Jazelle from the school. Steffi devised a password system to confirm that Jazelle goes with the correct colleague only.
The password on Monday was SJM16.
The password on Wednesday was TAW39.
There is a river to cross using a river raft and there are eight people (father, mother, policeman, thief, 2 daughters and 2 sons). No one knows to operate the raft except the adults and also excluding the thief. Only two people can go in the raft at a time. The raft should keep coming back and forth in order to pick and drop the people.
Rules to be followed:
Father: the father cannot stay in the raft or outside the raft without the presence of the mother.
Mother: the mother cannot stay in the raft or outside the rat without the presence of the father.
Thief: the thief is not allowed to stay with any of the family members unless there is a policeman.
Policeman: the policeman can travel with anyone.
2 sons and 2 daughters: they are not allowed to travel in the raft without the presence of an adult. They cannot either travel in the presence of only thieves without the policeman. The sons cannot be with their mothers without their father's supervision. The daughters are not allowed to be there with their fathers without the supervision of their mothers. But the daughters and the sons can be left unsupervised (as long as the other rules are applied).
What is the sequence that the people should follow in order to cross the river through the raft keeping in mind all the rules?
The rules are applicable not only in the raft but also outside the raft.
In 2007, a puzzle was released and $2 million prizes were offered for the first complete solution. The competition ended at noon on 31 December 2010, with no solution being found. Wiki