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.
A confectionary shop owner allows children to purchase a chocolate in exchange of five wrappers of the same chocolate. Children from the locality consumed 77 chocolates in a month. Now, they all collected them together and decide to buy back chocolates.
How many chocolates do you think they can buy using those 77 wrappers ?
The children can purchase 19 chocolates in return.
Out of 77 wrappers, 75 will be used to buy 15 chocolates and two will be left spare.
The 15 chocolates will create 15 empty wrappers that can be exchanged to get three chocolates.
Three chocolates will return three wrappers which will help them buy another chocolate.
Now the wrapper from this chocolate and the two spare that were left earlier will get them another chocolate.
15 + 3 + 1 = 19
You have two cubes with plane faces. You have to mark both the cubes with numbers in a manner that all the days of a month can be portrayed using those cubes. Also, note that you have to use both the cubes for displaying any date. Suppose if you have to display the 5th day of the month, you will have to display it as 05.
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.
Although it looks complicated, the answer is simple. The password to his computer is JIGSAW.
1st letter of Jug = J
2nd letter of Birthdays = I
3rd letter of Fights = G
4th letter of Cars =S
2nd letter of Laptops = A
1st letter of Watch = W
Suppose there is a Christmas tree and four angels are sitting on it amidst the other ornaments. Two of them have black halos and two of them have white halos. No body among them can see above their head. Angel A is sitting on the top branch and can see angels B and C sitting below him. B can see C who is sitting in a branch lower than his. Angel D is at the base of the tree and can't be seen due to the branches in between. Also, he can't see anybody as well.
If they are asked to guess the color of their own halo (they dont know that), who do you think will be able to deduce and speak up first with a right answer?
Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.
So either A or B will speak up first depending on the situation.
Michelangelo is being chased by a couple of cannibals who will kill him as soon as they get a hold of him. The only way to get rid of them is crossing the river bridge made of ropes and cut it on reaching the other end. He have found two diamonds in the woods each weighing 8 lbs. The rope is weak and can only accommodate a weight of 150 lbs. He weighs 140 lbs. Still he manages to cross the bridge and get rid of the cannibals with the diamonds without taking off any kind of clothing.
A worker is to perform work for you for seven straight days. In return for his work, you will pay him 1/7th of a bar of gold per day. The worker requires a daily payment of 1/7th of the bar of gold. What and where are the fewest number of cuts to the bar of gold that will allow you to pay him 1/7th each day?
Day One: You make your first cut at the 1/7th mark and give that to the worker.
Day Two: You cut 2/7ths and pay that to the worker and receive the original 1/7th in change.
Day three: You give the worker the 1/7th you received as change on the previous day.
Day four: You give the worker 4/7ths and he returns his 1/7th cut and his 2/7th cut as change.
Day Five: You give the worker back the 1/7th cut of gold.
Day Six: You give the worker the 2/7th cut and receive the 1/7th cut back in change.
Day Seven: You pay the worker his final 1/7th.
Submit your Email Address to get latest post directly to your inbox.