A man puts on a clean shirt every night before bed. On the first nigh he puts on a blue shirt. He than sleeps for 5 hours. Every one hour more he sleeps than the night before he put on a different color shirt the next night according to this scale: blue, black, red, green, white, pink, orange, brown, purple, yellow, grey, neon green, tan, and teal. Every one hour less he sleeps than the last night he put on a different color shirt the next night going backwards on his scale.
If he were to wear a blue shirt because he slept more hours than the last night he does. If it was because he slept less hours than the night before he skips it and wears a teal shirt instead. If he goes backwards on the scale and goes to blue but would not wear a blue shirt he still counts blue in his going backwards on his scale.
The second night the man wears a blue shirt because he did not sleep any more or less hours than the last night. The man sleeps for six hours that night.
The next night he sleeps for five hours.
Night number four he sleeps for eight hours.
The next night he sleeps for seven hours.
The next night he sleeps so well he sleeps for 11 hours.
Night number seven he stays up so late he only sleeps for four hours.
The next night he is so tired he sleeps for eight hours.
The next night he sleeps for eight hours again.
Night number ten he sleeps for 14 hours because he is sick.
Since he slept so long the last night he only sleeps for seven hours.
The next night he is a little bit tired so he sleeps for eight hours.
The night after that he had to do so much work he only slept five hours.
The next night at work they let him out early and he slept for nine hours.
The next night he slept for eight hours.
And the last night the man did he slept for ten hours.
The next night he put on a different color shirt according to his scale, but the next night he randomly picked a shirt. At what night will the man wear a blue shirt again?
A wise man lived on a hill above a small town. The townspeople often approached him to solve their difficult problems and riddles. One day, two lads decided to fool him. They took a dove and set off up the hill. Standing before him, one of the lads said "Tell me, wise man, is the dove I hold behind my back dead or alive?" The man smiled and said "I cannot answer your question correctly". Even though the wise man knew the condition of the dove, why wouldn't he state whether it was dead or alive?
The man told the two lads, "If I say the dove is alive, you will the bird and show me that it is dead. If I say that it is dead, you will release the dove and it will fly away. So you see I cannot answer your question.
Search: Schrödinger's cat
You are walking down a path when you come to two doors. Opening one of the doors will lead you to a life of prosperity and happiness, while opening the other door will lead to a life of misery and sorrow. You don't know which door leads to which life.
In front of the doors are two twin brothers who know which door leads where. One of the brothers always lies, and the other always tells the truth. You don't know which brother is the liar and which is the truth-teller.
You are allowed to ask one single question to one of the brothers (not both) to figure out which door to open.
What question should you ask?
Ask "If I asked your brother what the good door is, what would he say?"
If you ask the truth-telling brother, he will point to the bad door, because this is what the lying brother would point to.
Alternatively, if you ask the lying brother, he will also point to the bad door, because this is NOT what the truth-telling brother would point to.
So whichever door is pointed to, you should go through the other one.
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.
During the Summer Olympics, a fellow competed in the long jump and out-jumped everybody. He didn't just win the event, he actually broke the world record held for that event. Nobody broke his record for the remainder of the Olympics, and still today his name is in the record books.
However, even though he holds the world record, he never received a medal in the long jump. How did he manage to do so well, but not receive a medal?
He was competing in the decathlon. He won the long jump event, but didn't perform very well in the other events. He lost the decathlon, so he didn't receive any medals (even though he hold the world record for long jump).
A man owned a casino and invited some friends.
It was a dark stormy night, and they all placed their money on the table right before the lights went out.
When the lights came back on, the money was gone.
The owner put a rooster in an old rusty tea kettle.
He told everyone to get in line and touch the kettle after he turned the lights off, and the rooster will crow when the robber touched it.
After everyone touched it, the rooster didn't crow, so the man told everyone to hold out their hands.
After examining all the hands, he pointed out who the robber was.
How did he know who stole the money?
Because the tea kettle was rusty, whoever touched it would have rust on their hands. The robber didn't touch the kettle, therefore he was the only one whose hands weren't rusty.
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.
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."
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?
A man told his son that he would give him $1000 if he could accomplish the following task. The father gave his son ten envelopes and a thousand dollars, all in one dollar bills. He told his son, "Place the money in the envelopes in such a manner that no matter what number of dollars I ask for, you can give me one or more of the envelopes, containing the exact amount I asked for without having to open any of the envelopes. If you can do this, you will keep the $1000."
When the father asked for a sum of money, the son was able to give him envelopes containing the exact amount of money asked for. How did the son distribute the money among the ten envelopes?
The contents or the ten envelopes (in dollar bills) hould be as follows: $1, 2, 4, 8, 16, 32, 64, 128, 256, 489. The first nine numbers are in geometrical progression, and their sum, deducted from 1,000, gives the contents of the tenth envelope.
