You have ten sets of 10 coins. You are aware of exactly how much the coins weigh. You also know that all the coins in one set of ten are exactly a hundredth of an ounce off which makes the entire set of the ten coins a tenth of an ounce off. Also you are aware of the fact that all the other coins weight the correct amount. Now you are allowed to use an exceptionally precise digital weighing machine only once.
Keep one coin from the first set and place it on the scale along with the two from the second set etc. If the weight is off by one hundredth of an ounce, then you will know that it is the first set that is faulty and if the weight is off by two hundred of an ounce, then the second set is faulty and so on.
Four friends need to cross a dangerous bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.
Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.
1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)
A) Fill 5 ml gallon ( 5mlGallon - 5, 3mlGallon - 0)
B) Transfer to 3 ml gallon (5mlGallon - 2, 3mlGallon - 3)
C) Empty 3 ml gallon ( 5mlGallon - 2, 3mlGallon - 0)
D) Transfer 2 ml from 5 ml gallon to 3 ml gallon (5mlGallon - 0, 3mlGallon - 2)
E) Fill 5 ml gallon(5mlGallon - 5, 3mlGallon - 2)
F) Transfer 1 ml from 5 ml gallon to 3 ml gallons(5mlGallon - 4, 3mlGallon - 3)
Husband has prepared for a candle light dinner on the honeymoon for his wife. While they were having the dinner, a strong breeze flew through the open window and four candles out of ten were extinguished. After that, the husband closed the window.
A great meeting is held by a great logician where all the other logicians are called upon. The master logician takes them in a room and makes them sit in circle. A hat is placed on each of their heads. Now all of them can see the color of hats others are wearing but can’t see his own. They are told that there different colors of hats.
The master logician explains that a bell will be rung at regular intervals and the moment when a logician knows the color of his hat, he will leave on the next bell. If anyone leaves at the wrong bell, he will be disqualified and sent home.
All of them are assured of one thing that the puzzle will not be impossible for anyone of them. How will they manage the situation?
The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.
Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.
In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.
Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.
In a recreational activity, you are given four different jars of 2 liters, 4 liters, 6 liters and 8 liters respectively with an unlimited water supply. Then you are asked to measure exactly 5 liters of water using them.
In a jar, there are some orange candies and some strawberry candies. You pick up two candies at a time randomly. If the two candies are of same flavor, you throw them away and put a strawberry candy inside. If they are of opposite flavors, you throw them away and put an orange candy inside.
In such manner, you will be reducing the candies in the jar one at a time and will eventually be left with only one candy in the jar.
If you are told about the respective number of orange and strawberry candies at the outset, will it be feasible for you to predict the flavor of the final remaining candy ?
At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.
Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.
There are a hundred statements.
1st person says: At least one of the statements is incorrect.
2nd person says: At least two of the statements is incorrect.
3rd person says: At least three of the statements are incorrect.
4th person says: At least four of the statements are incorrect.
100th person says: At least a hundred of the statements are incorrect.
Now analyze all the statements and find out how many of them are incorrect and how many are true?
The 100th statement for sure is incorrect because it says that at least 100 of the statements are incorrect.
Suppose if that is correct, then 100 statements cannot be true.
This suggests that the 100th statement is incorrect and that the first statement is true.
Similarly 99 statements cannot be true because if they were true, then two statements would become correct i.e. the 1st and the 99th.
But the 99th statement says that at least 99 are incorrect.
This suggests that the 99th statement is incorrect and that 2ndone is true.
If we keep analyzing is the same way till the end, we will find out that only the first fifty statements are true and all the remaining ones are incorrect.
Three men are living in a desert namely – Alex, Brian and Chris.
Alex hates Chris and thus he decides to kill him. To succeed in his evil intentions, he poison the water supply of Chris. Since they are living in desert, he will have to drink water or he will die of thirst.
Brian is not aware of the actions of Alex and he plans to kill Chris as well. To do this, he killed the water supply of Chris.
This is more of a philosophical question than being a riddle or a puzzle. The action of Brian directly led to the result which is the death of Chris. Thus he murdered Chris. In a sense, Chris died due to the lack of water. It is the circumstances that ultimately led to his death.
Submit your Email Address to get latest post directly to your inbox.