For my anniversary, I decided to surprise my wife. Since she is a voracious reader, I decided to collect a lot of books for her. On the first day of the month, I bought one book, on the second, I bought two and on the third, I bought three. This process went on till the anniversary and on the day, I had 276 books with me to gift her.
Can you calculate, on which day is our anniversary?
Once there lived a king who did not allow anybody to leave the kingdom and any foreigners in his kingdom. There was only one bridge that connected his empire with the outer world. A guard who was a sharpshooter was specially assigned for a lookout on the bridge. According to the orders, anyone moving outside should be killed and anyone coming to his kingdom should be sent back. To take rest, the guard used to sit inside his hut for 5 minutes and return back on the lookout. The bridge took a minimum of 8 minutes to pass.
Even then, a woman was able to escape the kingdom without incurring any kind of harm to the guard.
The woman started walking across the bridge when the guard was inside the hut. She walked all the time he was inside (5 minutes) and then turned and moved back towards the kingdom. On approaching the kingdom he was asked for papers and since she did not have any, she was sent back.
An international IQ test is held on knockout terms in November 2013. The final contestants are from Britain and America respectively. Both of them are handed over the final test paper which they have to fill for evaluation. They have to write their names and date on the paper. When the evaluators are handed over the sheets, they find out that both the guys have same name. In no manner can they identify which sheet belongs to whom.
Can you identify the date on which the competition was held?
The competition was held on 11 November 2013. The logic is simple. In America, the dates are mentioned as Month/Day/Year and in Britain, dates are written as Day/Month/Year. But on 11 November 2013, the date and month will be the same. And thus both will write in the same manner i.e. 11/11/2013. If it would have been any other date, the evaluators would have been able to identify it.
John is out with his class of 25 boys to a local park. Each guy has a remote controlled car with them. The park has a racetrack that allows 5 cars to be raced at once. Their teacher, Mr. Ted, declares that the top three fastest cars get ice cream.
How many races are required to determine the 3 fastest cars?
As you can notice in the picture that ten coins have been arranged to form a triangle pointing upwards. What you have to do is move three coins and make that triangle point downwards. Can you do it in just 3 moves?
If we tie a sheep to one peg, a circled grass is been eaten by the sheep. If we tie the sheep to two pegs with a circle on its neck, then an eclipse is eaten out of the grass by the sheep. If we want an eclipse then we put two pegs then put a rope in between then and the other end of the rope is tied up on the sheep's neck.
Question: how should we tie the peg and the sheep so that a square is eaten out from the garden's grass? We only have one sheep's rope and the peg and the rings.
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.
A teacher is told that the principal of the school will be inspecting his class on the next day. Now, the teacher is worried for the impression that his class might cast on the principal since all the students are not intelligent. Also, the principal can ask questions from anywhere. However, he will have the power to choose any student for answering the question.
Now he wants that the principal must be impressed with the performance of his class. What will he do to maximize the final impression on the principal ?
The teacher will use a simple trick to form a perfect impression. He will ask all his students to raise their hands on each of the question that is asked. But the only catch will be that those who knows the answer correctly will raise their right hand and others will raise their left hand.
In this way, the principal will see all the hands being raised for each question even though all won't be knowing the correct answer. The teacher will ask only those who know the answer and they will always be correct. So the principal will be impressed to full extent.
You are sitting in front of your interviewer. He gives you three envelopes. One of them contains an offer letter and the other two are empty. You pick up one of them. Now, the interviewer opens up one of the envelope lying on the table and you find out that it is blank.
Now, he gives you a chance to switch your envelope with the one on the table. Would you switch it? Why or why not?
Yes, you should switch the envelope. In the beginning when you picked up the envelope, you had a 1/3 probability of finding an offer letter in the envelope. There was 2/3 chance that the letter was there in the two envelopes on the table.
If you keep your selected envelope, you still have a 1/3 chance of finding an offer letter in that. However, since the interviewer has removed one empty envelope from the table, if you switch, you have a probability of 2/3 that the offer letter is inside that.
Birbal is a witty trader who trade of a mystical fruit grown far in north. He travels from one place to another with three sacks which can hold 30 fruits each. None of the sack can hold more than 30 fruits. On his way, he has to pass through thirty check points and at each check point, he has to give one fruit for each sack to the authorities.
How many mystical fruits remain after he goes through all the thirty check points?
Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.
For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,
(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10
Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.
Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.
(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15
Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.
Submit your Email Address to get latest post directly to your inbox.