logicA new student met the Zen Master after traveling hundreds of miles by yak cart. He was understandably pleased with himself for being selected to learn at the great master's feet .
The first time they formally met, the Zen Master asked, "May I ask you a simple question?" "It would be an honor!" replied the student.
"Which is greater, that which has no beginning or that which has no end?" queried the Zen Master. "Come back when you have the answer and can explain why."
After the student made many frustrated trips back with answers which the master quickly cast off with a disapproving negative nod, the Zen Master finally said, "Perhaps I should ask you another question?"
"Oh, please do!" pleaded the exasperated student.
The Zen Master then asked, "Since you do not know that, answer this much simpler riddle. When can a pebble hold back the sea?" Again the student was rebuffed time and again. Several more questions followed with the same result. Each time, the student could not find the correct answer. Finally, completely exasperated, the student began to weep, "Master, I am a complete idiot. I can not solve even the simplest riddle from you!"
Suddenly, the student stopped, sat down, and said, "I am ready for my second lesson."
What was the Zen Master's first lesson?

The student's first lesson was that in order to learn from the Zen Master, the student should be asking the questions and not the Zen Master.

logicOnce there was a night watchman who had been caught several times sleeping on the job. The boss issued the final warning. On the next night he was caught with his head on his hand and his elbows on the desk. "Aha, I've caught you again," exclaimed the boss. The watchman's eyes popped open immediately and he knew what had happened. Being a quick thinking man, he said one word before looking up at the boss. The boss apologized profusely and went home. What was the one word?

The one word was "AMEN", thus making the Boss believe he was praying rather than sleeping.

logicLast week, the local Primary school was visited by the Government School Inspector who was there to check that teachers were performing well in their respective classes. He was very impressed with one particular teacher. The Inspector noticed that each time the class teacher asked a question, every child in the class put up their hands enthusiastically to answer it. More surprisingly, whilst the teacher chose a different child to answer the questions each time, the answers were always correct.
Why would this be?

The children were instructed to ALL raise their hands whenever a question was asked. It did not matter whether they knew the answer or not. If they did not know the answer, however, they would raise their LEFT hand. If they knew the answer, they would raise their RIGHT hand. The class teacher would choose a different child each time, but always the ones who had their RIGHT hand raised.

logic Fred went to a hardware store in Boston with Alex, Ben, and George. He noted that a hammer cost ten times as much as a screwdriver and a power saw cost ten times as much as a hammer. The storekeeper said that Ben could buy a power saw, George could buy a screwdriver and Alex could buy a hammer. Based on this what would the storekeeper let Fred buy?
Alex's full name is Alexander and Ben's full name is Benjamin. George was Alex's boss and good friend.

Fred could buy all three (the power saw, hammer and screw driver) since he had $111 with him (a $1 bill - George Washington, a $10 Alexander Hamilton, and a $100 bill - Ben Franklin). Boston is in the USA and therefore uses the US currency I just described.

logicshortThis is a newspaper headline:
Workers Strike - Want to Make Less Money!
What is going on?

The workers work at the mint and are tired of being overworked. They want to work less, which is making less money, since money is made at the mind!

logicmathEvery day, Jack arrives at the train station from work at 5 pm. His wife leaves home in her car to meet him there at exactly 5 pm, and drives him home. One day, Jack gets to the station an hour early, and starts walking home, until his wife meets him on the road. They get home 30 minutes earlier than usual. How long was he walking? Distances are unspecified. Speeds are unspecified, but constant. Give a number which represents the answer in minutes.

The best way to think about this problem is to consider it from the perspective of the wife. Her round trip was decreased by 30 minutes, which means each leg of her trip was decreased by 15 minutes. Jack must have been walking for 45 minutes.

logicmathThe owner of a banana plantation has a camel. He wants to transport his 3000 bananas to the market, which is located after the desert. The distance between his banana plantation and the market is about 1000 kilometer. So he decided to take his camel to carry the bananas. The camel can carry at the maximum of 1000 bananas at a time, and it eats one banana for every kilometer it travels.
What is the most bananas you can bring over to your destination?

First of all, the brute-force approach does not work. If the Camel starts by picking up the 1000 bananas and try to reach point B, then he will eat up all the 1000 bananas on the way and there will be no bananas left for him to return to point A.
So we have to take an approach that the Camel drops the bananas in between and then returns to point A to pick up bananas again.
Since there are 3000 bananas and the Camel can only carry 1000 bananas, he will have to make 3 trips to carry them all to any point in between.
When bananas are reduced to 2000 then the Camel can shift them to another point in 2 trips and when the number of bananas left are <= 1000, then he should not return and only move forward.
In the first part, P1, to shift the bananas by 1Km, the Camel will have to
Move forward with 1000 bananas – Will eat up 1 banana in the way forward
Leave 998 banana after 1 km and return with 1 banana – will eat up 1 banana in the way back
Pick up the next 1000 bananas and move forward – Will eat up 1 banana in the way forward
Leave 998 banana after 1 km and return with 1 banana – will eat up 1 banana in the way back
Will carry the last 1000 bananas from point a and move forward – will eat up 1 banana
Note: After point 5 the Camel does not need to return to point A again.
So to shift 3000 bananas by 1km, the Camel will eat up 5 bananas.
After moving to 200 km the Camel would have eaten up 1000 bananas and is now left with 2000 bananas.
Now in the Part P2, the Camel needs to do the following to shift the Bananas by 1km.
Move forward with 1000 bananas – Will eat up 1 banana in the way forward
Leave 998 banana after 1 km and return with 1 banana – will eat up this 1 banana in the way back
Pick up the next 1000 bananas and move forward – Will eat up 1 banana in the way forward
Note: After point 3 the Camel does not need to return to the starting point of P2.
So to shift 2000 bananas by 1km, the Camel will eat up 3 bananas.
After moving to 333 km the camel would have eaten up 1000 bananas and is now left with the last 1000 bananas.
The Camel will actually be able to cover 333.33 km, I have ignored the decimal part because it will not make a difference in this example.
Hence the length of part P2 is 333 Km.
Now, for the last part, P3, the Camel only has to move forward. He has already covered 533 (200+333) out of 1000 km in Parts P1 & P2. Now he has to cover only 467 km and he has 1000 bananas.
He will eat up 467 bananas on the way forward, and at point B the Camel will be left with only 533 Bananas.

logicmathHow to measure exactly 4 gallon of water from 3 gallon and 5 gallon jars, given, you have unlimited water supply from a running tap.

Step 1. Fill 3 gallon jar with water. ( 5p – 0, 3p – 3)
Step 2. Pour all its water into 5 gallon jar. (5p – 3, 3p – 0)
Step 3. Fill 3 gallon jar again. ( 5p – 3, 3p – 3)
Step 4. Pour its water into 5 gallon jar untill it is full. Now you will have exactly 1 gallon water remaining in 3 gallon jar. (5p – 5, 3p – 1)
Step 5. Empty 5 gallon jar, pour 1 gallon water from 3 gallon jar into it. Now 5 gallon jar has exactly 1 gallon of water. (5p – 1, 3p – 0)
Step 6. Fill 3 gallon jar again and pour all its water into 5 gallon jar, thus 5 gallon jar will have exactly 4 gallon of water. (5p – 4, 3p – 0)
We are done !

logicmathThere are 5 pirates in a ship. Pirates have hierarchy C1, C2, C3, C4 and C5.C1 designation is the highest and C5 is the lowest. These pirates have three characteristics : a. Every pirate is so greedy that he can even take lives to make more money. b. Every pirate desperately wants to stay alive. c. They are all very intelligent.There are total 100 gold coins on the ship. The person with the highest designation on the deck is expected to make the distribution. If the majority on the deck does not agree to the distribution proposed, the highest designation pirate will be thrown out of the ship (or simply killed). The first priority of the pirates is to stay alive and second to maximize the gold they get. Pirate 5 devises a plan which he knows will be accepted for sure and will maximize his gold. What is his plan?

To understand the answer,we need to reduce this problem to only 2 pirates. So what happens if there are only 2 pirates. Pirate 2 can easily propose that he gets all the 100 gold coins. Since he constitutes 50% of the pirates, the proposal has to be accepted leaving Pirate 1 with nothing.
Now let’s look at 3 pirates situation, Pirate 3 knows that if his proposal does not get accepted, then pirate 2 will get all the gold and pirate 1 will get nothing. So he decides to bribe pirate 1 with one gold coin. Pirate 1 knows that one gold coin is better than nothing so he has to back pirate 3. Pirate 3 proposes {pirate 1, pirate 2, pirate 3} {1, 0, 99}. Since pirate 1 and 3 will vote for it, it will be accepted.
If there are 4 pirates, pirate 4 needs to get one more pirate to vote for his proposal. Pirate 4 realizes that if he dies, pirate 2 will get nothing (according to the proposal with 3 pirates) so he can easily bribe pirate 2 with one gold coin to get his vote. So the distribution will be {0, 1, 0, 99}.
Smart right? Now can you figure out the distribution with 5 pirates? Let’s see. Pirate 5 needs 2 votes and he knows that if he dies, pirate 1 and 3 will get nothing. He can easily bribe pirates 1 and 3 with one gold coin each to get their vote. In the end, he proposes {1, 0, 1, 0, 98}. This proposal will get accepted and provide the maximum amount of gold to pirate 5.

logicmysteryIt was a man's birthday. He lay dead in the lounge room of his house. Next to his body was a note, written in pencil. The note read 'Happy Birthday, Friend'. The victim had a girlfriend and the police suspected her ex-boyfriend. They could find no obvious evidence. While searching the ex-boyfriend's car, the police saw an envelope with the girlfriend's address written on it. They thought they would get the handwriting checked against the note. The scientist in charge came in early to work the next day; it was 7am. He looked out his window which faced east and stared at the rising sun and it was then that he realised how to prove the ex-boyfriend killed the man, even though the girlfriend's address was not written in the same handwriting. How did he do it?

The scientist's office faced east, and the sun was coming in through the window at a very low angle. He saw some very faint shadows on the surface of the envelope. He looked closer. There were the words embossed on the paper. They read "Happy Birthday, Friend". The ex-boyfriend had forgotten that a pencil leaves an impression on paper beneath the page written on.