It 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.
A young boy went to a Catholic school. During school he started goofing around, so the teacher called him out and sent him to the Pastor. Since this was a traditional school the boy would be spanked, but the Pastor believed in giving people a chance.
He said, "If you can ask me a question about something you learned and I don't know the answer on the spot you will go free."
The boy may have been lazy, but he was very witty. He asked, "What is it that you can see and I can see, usually every day, but God cannot see." The Pastor stood there, stumped. He couldn't figure it out because he strongly believed that God sees and knows all, and that there is only one God. The boy smiled and told him.
What was it?
His own equal! We see our equals everyday, but since there is one God, he cannot see someone equal to himself.
You have 25 horses. When they race, each horse runs at a different, constant pace. A horse will always run at the same pace no matter how many times it races.
You want to figure out which are your 3 fastest horses. You are allowed to race at most 5 horses against each other at a time. You don't have a stopwatch so all you can learn from each race is which order the horses finish in.
What is the least number of races you can conduct to figure out which 3 horses are fastest?
You need to conduct 7 races.
First, separate the horses into 5 groups of 5 horses each, and race the horses in each of these groups. Let's call these groups A, B, C, D and E, and within each group let's label them in the order they finished. So for example, in group A, A1 finished 1st, A2 finished 2nd, A3 finished 3rd, and so on.
We can rule out the bottom two finishers in each race (A4 and A5, B4 and B5, C4 and C5, D4 and D5, and E4 and E5), since we know of at least 3 horses that are faster than them (specifically, the horses that beat them in their respective races).
This table shows our remaining horses:
A1 B1 C1 D1 E1
A2 B2 C2 D2 E2
A3 B3 C3 D3 E3
For our 6th race, let's race the top finishers in each group: A1, B1, C1, D1 and E1. Let's assume that the order of finishers is: A1, B1, C1, D1, E1 (so A1 finished first, E1 finished last).
We now know that horse D1 cannot be in the top 3, because it is slower than C1, B1 and A1 (it lost to them in the 6th race). Thus, D2 and D3 can also not be in the to 3 (since they are slower than D1).
Similarly, E1, E2 and E3 cannot be in the top 3 because they are all slower than D1 (which we already know isn't in the top 3).
Let's look at our updated table, having removed these horses that can't be in the top 3:
A1 B1 C1
A2 B2 C2
A3 B3 C3
We can actually rule out a few more horses. C2 and C3 cannot be in the top 3 because they are both slower than C1 (and thus are also slower than B1 and A1). And B3 also can't be in the top 3 because it is slower than B2 and B1 (and thus is also slower than A1). So let's further update our table:
A1 B1 C1
A2 B2
A3
We actually already know that A1 is our fastest horse (since it directly or indirectly beat all the remaining horses). So now we just need to find the other two fastest horses out of A2, A3, B1, B2 and C1. So for our 7th race, we simply race these 5 horses, and the top two finishers, plus A1, are our 3 fastest horses.
A young peasant wanted to marry the king's daughter. The king didn't like the idea of his daughter marrying a peasant, but he wanted to appear fair in front of his subjects. The king said that he would put two pieces of paper into a hat, one reading "exile" and the other reading "marriage". Later that day, the peasant overheard the king saying that both pieces of paper would read "exile", thus ensuring that the peasant would be out of his way for good. The peasant remained undaunted and, as arranged, arrived at the king's court where a large crown gathered for the big event. The peasant then did something that assured him the hand of the king's daughter. What did he do?
The peasant picked one of the pieces of paper and tore it up. He then asked the kind to show him the other piece of paper which, of course, said EXILE. The king, not wishing to appear fraudulent in front of his subjects, granted that the piece of paper the peasant had picked must have said MARRIAGE.
