A dead body is found at the bottom of a multistory building. Seeing the position of the body, it is evident that the person jumped from one of the floors, committing suicide.
A homicide detective is called to look after the case. He goes to the first floor and walks in the room facing the direction in which the body was found.
He opens the window in that direction and flips a coin towards the floor. Then he goes to the second floor and repeats the process. He keeps on doing this until he reaches the last floor. Then, when he climbs down he tells the team that it is a murder not suicide.
How did he come to know that it was a murder?

None of the windows were left open. If the person jumped, who closed the window?

You are somewhere on Earth. You walk due south 1 mile, then due east 1 mile, then due north 1 mile. When you finish this 3-mile walk, you are back exactly where you started.
It turns out there are an infinite number of different points on earth where you might be. Can you describe them all?
It's important to note that this set of points should contain both an infinite number of different latitudes, and an infinite number of different longitudes (though the same latitudes and longitudes can be repeated multiple times); if it doesn't, you haven't thought of all the points.

One of the points is the North Pole. If you go south one mile, and then east one mile, you're still exactly one mile south of the North Pole, so you'll be back where you started when you go north one mile.
To think of the next set of points, imagine the latitude slighty north of the South Pole, where the length of the longitudinal line around the Earth is exactly one mile (put another way, imagine the latitude slightly north of the South Pole where if you were to walk due east one mile, you would end up exactly where you started). Any point exactly one mile north of this latitude is another one of the points you could be at, because you would walk south one mile, then walk east a mile around and end up where you started the eastward walk, and then walk back north one mile to your starting point. So this adds an infinite number of other points we could be at. However, we have not yet met the requirement that our set of points has an infinite number of different latitudes.
To meet this requirement and see the rest of the points you might be at, we just generalize the previous set of points. Imagine the latitude slightly north of the South Pole that is 1/2 mile in distance. Also imagine the latitudes in this area that are 1/3 miles in distance, 1/4 miles in distance, 1/5 miles, 1/6 miles, and so on. If you are at any of these latitudes and you walk exactly one mile east, you will end up exactly where you started. Thus, any point that is one mile north of ANY of these latitudes is another one of the points you might have started at, since you'll walk one mile south, then one mile east and end up where you started your eastward walk, and finally, one mile north back to where you started.

100 men are in a room, each wearing either a white or black hat. Nobody knows the color of his own hat, although everyone can see everyone else's hat. The men are not allowed to communicate with each other at all (and thus nobody will ever be able to figure out the color of his own hat).
The men need to line up against the wall such that all the men with black hats are next to each other, and all the men with white hats are next to each other. How can they do this without communicating? You can assume they came up with a shared strategy before coming into the room.

The men go to stand agains the wall one at a time. If a man goes to stand against the wall and all of the men already against the wall have the same color hat, then he just goes and stands at either end of the line. However, if a man goes to stand against the wall and there are men with both black and white hats already against the wall, he goes and stands between the two men with different colored hats. This will maintain the state that the line contains men with one colored hats on one side, and men with the other colored hats on the other side, and when the last man goes and stands against the wall, we'll still have the desired outcome.

A duke was hunting in the forest with his men-at-arms and servants when he came across a tree.
Upon it, archery targets were painted and smack in the middle of each was an arrow.
"Who is this incredibly fine archer?" cried the duke. "I must find him!"
After continuing through the forest for a few miles he came across a small boy carrying a bow and arrow.
Eventually the boy admitted that it was he who shot the arrows plumb in the center of all the targets.
"You didn't just walk up to the targets and hammer the arrows into the middle, did you?" asked the duke worriedly.
"No my lord. I shot them from a hundred paces. I swear it by all that I hold holy."
"That is truly astonishing," said the duke. "I hereby admit you into my service."
The boy thanked him profusely.
"But I must ask one favor in return," the duke continued.
"You must tell me how you came to be such an outstanding shot."
How'd he get to be such a good shot?

The boy shot the arrow, then painted the circle around it.

You have just purchased a small company called Company X. Company X has N employees, and everyone is either an engineer or a manager. You know for sure that there are more engineers than managers at the company.
Everyone at Company X knows everyone else's position, and you are able to ask any employee about the position of any other employee. For example, you could approach employee A and ask "Is employee B an engineer or a manager?" You can only direct your question to one employee at a time, and can only ask about one other employee at a time. You're allowed to ask the same employee multiple questions if you want.
Your goal is to find at least one engineer to solve a huge problem that has just hit the company's factory. The problem is so urgent that you only have time to ask N-1 total questions.
The major problem with questioning the employees, however, is that while the engineers will always tell you the truth about other employees' roles, the managers may lie to you if they like. You can assume that the managers will do their best to confuse you.
How can you find at least one engineer by asking at most N-1 questions?

You can find at least one engineer using the following process:
Put all of the employees in a conference room. If there happen to be an even number of employees, pick one at random and send him home for the day so that we start with an odd number of employees. Note that there will still be more engineers than managers after we send this employee home.
Then call them out one at a time in any order. You will be forming them into a line as follows:
If there is nobody currently in the line, put the employee you just called out in the line.
Otherwise, if there is anybody in the line, then we do the following. Let's call the employee currently at the front of the line Employee_Front, and call the employee who we just called out of the conference room Employee_Next.
So ask Employee_Front if Employee_Next is a manager or an engineer.
If Employee_Front says "manager", then send both Employee_Front and Employee_Next home for the day.
However, if Employee_Front says "engineer", then put Employee_Next at the front of the line.
Keep doing this until you've called everyone out of the conference room. Notice that at this point, you'll have asked N-1 or less questions (you asked at most one question each time you called an employee out except for the first employee, when you didn't ask a question, so that's at most N-1 questions).
When you're done calling everyone out of the conference room, the person at the front of the line is an engineer. So you've found your engineer!
But the real question: how does this work?
We can prove this works by showing a few things.
First, let's show that if there are any engineers in the line, then they must be in front of any managers.
We'll show this with a proof by contradiction. Assume that there is a manager in front of an engineer somewhere in the line. Then it must have been the case that at some point, that engineer was Employee_Front and that manager was Employee_Next. But then Employee_Front would have said "manager" (since he is an engineer and always tells the truth), and we would have sent them both home. This contradicts their being in the line at all, and thus we know that there can never be a manager in front of an engineer in the line.
So now we know that after the process is done, if there are any engineers in the line, then they will be at the front of the line. That means that all we have to prove now is that there will be at least one engineer in the line at the end of the process, and we'll know that there will be an engineer at the front.
So let's show that there will be at least one engineer in the line. To see why, consider what happens when we ask Employee_Front about Employee_Next, and Employee_Front says "manager". We know for sure that in this case, Employee_Front and Employee_Next are not both engineers, because if this were the case, then Employee_Front would have definitely says "engineer". Put another way, at least one of Employee_Front and Employee_Next is a manager. So by sending them both home, we know we are sending home at least one manager, and thus, we are keeping the balance in the remaining employees that there are more engineers than managers.
Thus, once the process is over, there will be more engineers than managers in the line (this is also sufficient to show that there will be at least one person in the line once the process is over). And so, there must be at least one engineer in the line.
Put altogether, we proved that at the end of the process, there will be at least one engineer in the line and that any engineers in the line must be in front of any managers, and so we know that the person at the front of the line will be an engineer.

Jack and Joe were on vacation and driving along a deserted country road from the town of Kaysville to the town of Lynnsville. They came to a multiple fork in the road. The sign post had been knocked down and they were faced with choosing one of five different directions. Since they had left their map at the last gas station and there was no one around to ask, how could Jack and Joe find their way to Lynnsville?

They need to stand the signpost up so that the arm reading Kaysville points in the direction of Kaysville, the town they had just come from. With one arm pointing the correct way, the other arms will also point in the right directions.

Once upon a time, in the West Lake village, a servant lived with his master. After service of about 30 years, his master became ill and was going to die.
One day, the master called his servant and asked him for a wish. It could be any wish but just one. The master gave him one day to think about it. The servant became very happy and went to his mother for discussion about the wish. His mother was blind and she asked her son for making a wish for her eye-sight to come back. Then the servant went to his wife. She became very excited and asked for a son as they were childless for many years. After that, the servant went to his father who wanted to be rich and so he asked his son to wish for a lot of money. The next day he went to his master and made one wish through which all the three (mother, father, wife) got what they wanted. You have to tell what the servant asked the master.

The servant said, "My mother wants to see her grandson swinging on a swing of gold."

One day, Emperor Akbar posed a question to Birbal. He asked him what Birbal would choose if he offered either justice or a gold coin.
"The gold coin," said Birbal without hesitation.
On hearing this, Akbar was taken aback. "You would prefer a gold coin to justice?" he asked, not believing his own ears.
"Yes," said Birbal.
The other courtiers were amazed by Birbal's display of idiocy. They were full of glee that Birbal had finally managed himself to do what these courtiers had not been able to do for a long time - discredit Birbal in the emperor's eyes!
"I would have been disappointed if this was the choice made even by my lowliest of servants," continued the emperor. "But coming from you it's not only disappointing, but shocking and sad. I did not know you were so debased!"
How did Birbal justify his answer to the enraged and hurt Emperor?

"One asks for what one does not have, Your Majesty." said Birbal, smiling gently and in quiet tones.
"Under Your Majesty´s rule, justice is available to everybody. But I am a spendthrift and always short of money and therefore I said I would choose the gold coin."
The answer immensely pleased the emperor and respect for Birbal was once again restored in the emperor's eyes.

A monk leaves at sunrise and walks on a path from the front door of his monastery to the top of a nearby mountain. He arrives at the mountain summit exactly at sundown. The next day, he rises again at sunrise and descends down to his monastery, following the same path that he took up the mountain.
Assuming sunrise and sunset occured at the same time on each of the two days, prove that the monk must have been at some spot on the path at the same exact time on both days.

Imagine that instead of the same monk walking down the mountain on the second day, that it was actually a different monk. Let's call the monk who walked up the mountain monk A, and the monk who walked down the mountain monk B. Now pretend that instead of walking down the mountain on the second day, monk B actually walked down the mountain on the first day (the same day monk A walks up the mountain).
Monk A and monk B will walk past each other at some point on their walks. This moment when they cross paths is the time of day at which the actual monk was at the same point on both days. Because in the new scenario monk A and monk B MUST cross paths, this moment must exist.

A king has 100 identical servants, each with a different rank between 1 and 100. At the end of each day, each servant comes into the king's quarters, one-by-one, in a random order, and announces his rank to let the king know that he is done working for the day. For example, servant 14 comes in and says "Servant 14, reporting in."
One day, the king's aide comes in and tells the king that one of the servants is missing, though he isn't sure which one.
Before the other servants begin reporting in for the night, the king asks for a piece of paper to write on to help him figure out which servant is missing. Unfortunately, all that's available is a very small piece that can only hold one number at a time. The king is free to erase what he writes and write something new as many times as he likes, but he can only have one number written down at a time.
The king's memory is bad and he won't be able to remember all the exact numbers as the servants report in, so he must use the paper to help him.
How can he use the paper such that once the final servant has reported in, he'll know exactly which servant is missing?

When the first servant comes in, the king should write down his number. For each other servant that reports in, the king should add that servant's number to the current number written on the paper, and then write this new number on the paper.
Once the final servant has reported in, the number on the paper should equal
(1 + 2 + 3 + ... + 99 + 100) - MissingServantsNumber
Since (1 + 2 + 3 + ... + 99 + 100) = 5050, we can rephrase this to say that the number on the paper should equal
5050 - MissingServantsNumber
So to figure out the missing servant's number, the king simply needs to subtract the number written on his paper from 5050:
MissingServantsNumber = 5050 - NumberWrittenOnThePaper

You've been placed on a course of expensive medication in which you are to take one tablet of Plusin and one tablet of Minusin daily. You must be careful that you take just one of each because taking more of either can have serious side effects. Taking Plusin without taking Minusin, or vice versa, can also be very serious, because they must be taken together in order to be effective. In summary, you must take exactly one of the Plusin pills and one of the Minusin pills at one time.
Therefore, you open up the Plusin bottle, and you tap one Plusin pill into your hand. You put that bottle aside and you open the Minusin bottle. You do the same, but by mistake, two Minusins fall into your hand with the Plusin pill.
Now, here's the problem. You weren't watching your hand as the pills fell into it, so you can't tell the Plusin pill apart from the two Minusin pills. The pills look identical. They are both the same size, same weight (10 micrograms), same color (Blue), same shape (perfect square), same everything, and they are not marked differently in any way.
What are you going to do?
You cannot tell which pill is which, and they cost $500 a piece, so you cannot afford to throw them away and start over again. How do you get your daily dose of exactly one Plusin and exactly one Minusin without wasting any of the pills?

Carefully cut each of the three pills in half, and carefully separate them into two piles, with half of each pill in each pile. You do not know which pill is which, but you are 100% sure that each of the two piles now contains two halves of Minusin and half of Plusin. Now go back into the Plusin bottle, take out a pill, cut it in half, and add one half to each stack. Now you have two stacks, each one containing two halves of Plusin and two halves of Minusin. Take one stack of pills today, and save the second stack for tomorrow.