logicMarty and Jill want to copy three 60 minute tapes. They have two tape recorders that will dub the tapes for them, so they can do two at a time. It takes 30 minutes for each side to complete; therefore in one hour two tapes will be done, and in another hour the third will be done. Jill says all three tapes can be made in 90 minutes. How?

Jill will rotate the three tapes. Let's call them tapes 1,2, and 3 with sides A and B. In the first 30 minutes they will tape 1A and 2A, in the second 3 minutes they will tape 1B and 3A (Tape 1 is now done). Finally, in the last 30 minutes, they will tape 2B and 3B.

logicshortWhy do elephants have trunks?

Because they'd look silly with handbags.

logicshortA 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

logicshortwhat am IIf will follow you for 1000 miles but not miss home. It desires neither food nor flowers. It fears not water, fire, knives, nor soldiers. But it disappears when the sun sets behind the western mountains. Who Am I?

Shadow.

logicmysteryYou have two sand hourglasses, one that measures exactly 4 minutes and one that measures exactly 7 minutes. You need to measure out exactly 2 minutes to boil an egg. Using only these two hourglasses, how can you measure out exactly 2 minutes to boil your egg?

Flip over both hourglasses at the same time.
After 4 minutes, the 4-minute hourglass will be done, and there will be 3 minutes left in the 7-minute hourglass. Immediately flip the 4-minute hourglass over again.
After 3 more minutes, the 7-minute hourglass will be done, and there will be exactly 1 minute left in the 4-minute hourglass. Immediately flip the 7-minute hourglass over again.
After 1 more minute, the 4-minute hourglass will be done again, and there will be exactly 6 minutes left in the 7-minute hourglass. Immediately flip over the 4-minute hourglass.
After 4 more minutes, the 4-minute hourglass will be done again, and there will be exactly 2 minutes left in the 7-minute hourglass. At this point, put your egg in the boiling water. When the 7-minute hourglass is done, it will have been exactly 2 more minutes, and your egg will have boiled just right.

logicYou're walking down a path and come to two doors. One of the doors leads to a life of prosperity and happiness, and the other door leads to a life of misery and sorrow. You don't know which door is which.
In front of the door is ONE man. You know that this man either always lies, or always tells the truth, but you don't know which. The man knows which door is which.
You are allowed to ask the man ONE yes-or-no question to figure out which door to go through. To make things more difficult, the man is very self-centered, so you are only allowed to ask him a question about what he thinks or knows; your question cannot involve what any other person or object (real or hypothetical) might say.
What question should you ask to ensure you go through the good door?

You should ask: "If I asked you if the good door is on the left, would you say yes?"
Notice that this is subtly different than asking "Is the good door on the left?", in that you are asking him IF he would say yes to that question, not what his answer to the question would be. Thus you are asking a question about a question, and if it ends up being the liar you are talking to, this will cause him to lie about a lie and thus tell the truth. The four possible cases are:
The man is a truth-teller and the good door is on the left. He will say "yes".
The man is a truth-teller and the good door is on the right. He will say "no".
The man is a liar and the good door is on the left. He will say "yes" because if you asked him "Is the good door on the left?", he would lie and say "no", and so when you ask him if he would say "yes", he will lie and say "yes".
The man is a liar and the good door is on the right. Similar to the previous example, he'll say "no".
So regardless of whether the man is a truth-teller or a liar, this question will get a "yes" if the door on the left is the good door, and a "no" if it's not.

logicYou 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.

funnylogicwhat am IWhat am I?

A question.

logicA guard is stationed at the entrance to a bridge. He is tasked to shoot anyone who tries to cross to the other side of the bridge, and to turn away anyone who comes in from the opposite side of the bridge. You are on his side of the bridge and want to escape to the other side.
Because the bridge is old and rickety, anyone who tries to cross it does so at a constant speed, and it always takes exactly 10 minutes to cross.
The guard comes out of his post every 6 minutes and looks down the bridge for any people trying to leave, and at all other times he sits in his post and snoozes. You know you can sneak past him when he's sleeping, but the problem is that you won't be able to make it all the way to the other side of the bridge before he sees you (since he comes out every 6 minutes, but it takes 10 minutes to cross).
One day a brilliant idea comes to you, and soon you've successfully crossed to the other side of the bridge without being shot. How did you do it?

Right after the guard goes back to his post after checking the bridge, you sneak by and make your way down the bridge. After a little bit less than 6 minutes, you turn around and start walking back toward the guard. He will come out and see you, and assume that you are a visitor coming from the other side of the bridge, since you're only about 4 minutes from the end of the other side of the bridge. He will go back into his post since he doesn't plan to turn you away until you reach him, and then you turn back around and make your way the rest of the way to the other side of the bridge.

animallogicmathThere are 100 ants on a board that is 1 meter long, each facing either left or right and walking at a pace of 1 meter per minute.
The board is so narrow that the ants cannot pass each other; when two ants walk into each other, they each instantly turn around and continue walking in the opposite direction. When an ant reaches the end of the board, it falls off the edge.
From the moment the ants start walking, what is the longest amount of time that could pass before all the ants have fallen off the plank? You can assume that each ant has infinitely small length.

The longest amount of time that could pass would be 1 minute.
If you were looking at the board from the side and could only see the silhouettes of the board and the ants, then when two ants walked into each other and turned around, it would look to you as if the ants had walked right by each other.
In fact, the effect of two ants walking into each other and then turning around is essentially the same as two ants walking past one another: we just have two ants at that point walking in opposite directions.
So we can treat the board as if the ants are walking past each other. In this case, the longest any ant can be on the board is 1 minute (since the board is 1 meter long and the ants walk at 1 meter per minute). Thus, after 1 minute, all the ants will be off the board.