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
A woman who lived in Germany during World War II wanted to cross the German/Swiss border in order to escape Nazi pursuers. The bridge which she is to cross is a half mile across, over a large canyon. Every three minutes a guard comes out of his bunker and checks if anyone is on the bridge. If a person is caught trying to escape German side to the Swiss side they are shot. If caught crossing the other direction without papers they are sent back. She knows that it takes at least five minutes to cross the bridge, in which time the guard will see her crossing and shoot her. How does she get across?
She waits until the guard goes inside his hunt, and begins to walk across the bridge. She gets a little more than half way, turns around, and begins to walk toward the german side once more. The guard comes out, sees that she has no papers, and sends her "back" to the swiss side.
Today is Admin's birthday. His five close friends Nell, Edna, Harish, Hsirah and Ellen surprised him with party.
What is special with this list of these five names?
If you read the names from last to start, it reads the same.
Three ants are sitting at the three corners of an equilateral triangle. Each ant starts randomly picks a direction and starts to move along the edge of the triangle. What is the probability that none of the ants collide?
So let’s think this through. The ants can only avoid a collision if they all decide to move in the same direction (either clockwise or anti-clockwise). If the ants do not pick the same direction, there will definitely be a collision. Each ant has the option to either move clockwise or anti-clockwise. There is a one in two chance that an ant decides to pick a particular direction. Using simple probability calculations, we can determine the probability of no collision.
P(No collision) = P(All ants go in a clockwise direction) + P( All ants go in an anti-clockwise direction) = 0.5 * 0.5 * 0.5 + 0.5 * 0.5 * 0.5 = 0.25
Six glasses are in a row. The first three are filled with milk and the last three are empty. By moving only one glass, can you arrange them so that the full and the empty glasses alternate?
Just pour full glass of milk at 2nd position in 5th glass(empty) and keep that empty glass back at 2nd position.
Then full and empty glasses are at alternate positions.
Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?
It is 17 mins.
1 and 2 go first, then 1 comes back. Then 7 and 10 go and 2 comes back. Then 1 and 2 go again, it makes a total of 17 minutes.
Swaff was traveling in an elevator, being cool, when he suddenly heard the cord supporting the elevator snap. Being the cool guy that he is, he knew of a myth where if you could jump at the right time, you could possibly be able to survive a plunge in an elevator.
Now, when Swaff was a boy, he spent all of his math classes making fun of his female teacher's moustache. He never paid attention, so he was a tad bit slow in his mathematical calculations. He did, however, have a very bizarre talent, in which he could tell the exact speed he was traveling. That came in pretty lucky today.
Swaff knew he was falling at an even rate of 50 miles per hour. When the cord snapped, he was exactly 110 feet above the ground. He knew that he must jump at the right time to have any hopes of surviving.
Now, after doing the math, please tell me when Swaff jumped.
He never did. By the time Swaff figured out that he would have to jump in 1.5 seconds, he would already be dead. Not even the best of mathematicians could do all the math needed in 1 and half seconds. Swaff fell to his death.
There are ten people in a house. Everybody wants to make a hand shake with only people shorter than themselves. Assume everybody is different in height. How many hand shakes are made?
0, because a taller person wants to shake hands with a shorter person. But the shorter person doesn't want to shake hands with him.
You are visiting NYC when a man approaches you.
"Not counting bald people, I bet a hundred bucks that there are two people living in New York City with the same number of hairs on their heads," he tells you.
"I'll take that bet!" you say. You talk to the man for a minute, after which you realize you have lost the bet.
What did the man say to prove his case?
This is a classic example of the pigeonhole principle. The argument goes as follows: assume that every non-bald person in New York City has a different number of hairs on their head. Since there are about 9 million people living in NYC, let's say 8 million of them aren't bald.
So 8 million people need to have different numbers of hairs on their head. But on average, people only have about 100,000 hairs. So even if there was someone with 1 hair, someone with 2 hairs, someone with 3 hairs, and so on, all the way up to someone with 100,000 hairs, there are still 7,900,000 other people who all need different numbers of hairs on their heads, and furthermore, who all need MORE than 100,000 hairs on their head.
You can see that additionally, at least one person would need to have at least 8,000,000 hairs on their head, because there's no way to have 8,000,000 people all have different numbers of hairs between 1 and 7,999,999. But someone having 8,000,000 is an essential impossibility (as is even having 1,000,000 hairs), So there's no way this situation could be the case, where everyone has a different number of hairs. Which means that at least two people have the same number of hairs.
You can easily "tile" an 8x8 chessboard with 32 2x1 tiles, meaning that you can place these 32 tiles on the board and cover every square.
But if you take away two opposite corners from the chessboard, it becomes impossible to tile this new 62-square board.
Can you explain why tiling this board isn't possible?
Color in the chessboard, alternating with red and blue tiles. Then color all of your tiles half red and half blue. Whenever you place a tile down, you can always make it so that the red part of the tile is on a red square and the blue part of the tile is on the blue square.
Since you'll need to place 31 tiles on the board (to cover the 62 squares), you would have to be able to cover 31 red squares and 31 blue squares. But when you took away the two corners, you can see that you are taking away two red spaces, leaving 30 red squares and 32 blue squares. There is no way to cover 30 red squares and 32 blue squares with the 31 tiles, since these tiles can only cover 31 red squares and 31 blue squares, and thus, tiling this board is not possible.
