At a dinner party, many of the guests exchange greetings by shaking hands with each other while they wait for the host to finish cooking.
After all this handshaking, the host, who didn't take part in or see any of the handshaking, gets everybody's attention and says: "I know for a fact that at least two people at this party shook the same number of other people's hands."
How could the host know this? Note that nobody shakes his or her own hand.
Assume there are N people at the party.
Note that the least number of people that someone could shake hands with is 0, and the most someone could shake hands with is N-1 (which would mean that they shook hands with every other person).
Now, if everyone at the party really were to have shaken hands with a different number of people, then that means somone must have shaken hands with 0 people, someone must have shaken hands with 1 person, and so on, all the way up to someone who must have shaken hands with N-1 people. This is the only possible scenario, since there are N people at the party and N different numbers of possible people to shake hands with (all the numbers between 0 and N-1 inclusive).
But this situation isn't possible, because there can't be both a person who shook hands with 0 people (call him Person 0) and a person who shook hands with N-1 people (call him Person N-1). This is because Person 0 shook hands with nobody (and thus didn't shake hands with Person N-1), but Person N-1 shook hands with everybody (and thus did shake hands with Person 0). This is clearly a contradiction, and thus two of the people at the party must have shaken hands with the same number of people.
Pretend there were only 2 guests at the party. Then try 3, and 4, and so on. This should help you think about the problem.
Search: Pigeonhole principle
There are 4 big houses in my home town. They are made from these materials: red marbles, green marbles, white marbles and blue marbles.
Mrs Jennifer's house is somewhere to the left of the green marbles one and the third one along is white marbles.
Mrs Sharon owns a red marbles house and Mr Cruz does not live at either end, but lives somewhere to the right of the blue marbles house.
Mr Danny lives in the fourth house, while the first house is not made from red marbles.
Who lives where, and what is their house made from ?
From, left to right:
#1 Mrs Jennifer - blue marbles
#2 Mrs Sharon - red marbles
#3 Mr Cruz - white marbles
#4 Mr Danny - green marbles
If we separate and label the clues, and label the houses #1, #2, #3, #4 from left to right we can see that:
a. Mrs Jennifer's house is somewhere to the left of the green marbles one.
b. The third one along is white marbles.
c. Mrs Sharon owns a red marbles house
d. Mr Cruz does not live at either end.
e. Mr Cruz lives somewhere to the right of the blue marbles house.
f. Mr Danny lives in the fourth house
g. The first house is not made from red marbles.
By (g) #1 isn't made from red marbles, and by (b) nor is #3. By (f) Mr Danny lives in #4 therefore by (c) #2 must be red marbles, and Mrs Sharon lives there.
Therefore by (d) Mr Cruz must live in #3, which, by (b) is the white marbles house. By (a) #4 must be green marbles (otherwise Mrs Jennifer couldn't be to its left) and by (f) Mr Danny lives there.
Which leaves Mrs Jennifer, living in #1, the blue marbles house.
Our dinner guests cry that we are evil, when they notice their place in the meal. But its no big deal why; we are just one big happy tribe! And we get really fed up with people!
Who, What or Are we?
100 people are standing in a circle. The person standing at number 1 is having a sword. He kills the person next to him with the sword and then gives the sword to the third person. This process is carried out till there is just one person left. Which number survives at the last?
73rd person will survive at last.
If the number of players is the power of 2, the last person to survive will be the one who started it.
But since the number here is not the power of 2, we will take the greatest power of 2 that is less than the number of players (100) which is 64.
So when starting with 100 players - we need to kill 36 of them to get down to a power of 2 (64). Since we kill every other person starting at player 2 the last person we need to die is player 72, they will be killed by player 71 and the first person in the effective power of 2 game, who will win is player 73.
It's worth noting that this process of reducing to a power of 2 will always be completed in the first round regardless of the number of players.
Consider X players, let Y be the highest power of 2 that is less than or equal to Y
The winning player is 2 * (X - Y) + 1
