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.

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

animalcleanlogicA horse is tied to a fifteen-foot rope and there is a bale of hay 25 feet away from him. The horse however is still able to eat from the hay. How is this possible?

The rope wasn't tied to anything.

logicBill and Stacie are delighted when their new baby, Patrick, is born on February 29th, 2008. They think it's good luck to for him to be born on the special day of the leap year. But then they start thinking about when to celebrate his next birthday. After some thought, they decide that they want to celebrate Patrick's next birthday (when he turns 1) exactly 365 days after he was born, just like most people do.
What will be the date of this birthday?

The date of the birthday will be February 28th, 2009.
At first it might seem like his birthday should be March 1st, 2009, since February 29th is the day after February 28th in the leap year, while March 1st is the day after February 28th in non-leap years. But this is the wrong way to think about it.
The right way to think about it is that 365 days after the day before March 1st is always February 28th, regardless of whether it's a leap year or not. So Patrick's birthday will be February 28th.

animallogicA frog is at the bottom of a well. It is a 30 foot climb to get out. Each morning, the frog jumps 3 feet up the path out, but each night, as it sleeps, it slips back 2 feet down.
Thus, at the beginning of the first day, the frog has 30 feet to go, at the beginning of the second day it has 29 feet to go, and so on.
How many days does it take the frog to get out of the well?

It takes 28 days for the frog to get out (it gets out on the morning of the 28th day).
This is because on the beginning of the 28th day, the frog has 3 feet left to travel. Because the frog jumps 3 feet forward each morning, it will jump out of the well on this day.

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

logicA deliveryman comes to a house to drop off a package. He asks the woman who lives there how many children she has.
"Three," she says. "And I bet you can't guess their ages."
"Ok, give me a hint," the deliveryman says.
"Well, if you multiply their ages together, you get 36," she says. "And if you add their ages together, the sum is equal to our house number."
The deliveryman looks at the house number nailed to the front of her house. "I need another hint," he says.
The woman thinks for a moment. "My youngest son will have a lot to learn from his older brothers," she says.
The deliveryman's eyes light up and he tells her the ages of her three children. What are their ages?

Their ages are 1, 6, and 6. We can figure this out as follows:
Given that their ages multiply out to 36, the possible ages for the children are:
1, 1, 36 (sum = 38)
1, 2, 18 (sum = 21)
1, 3, 12 (sum = 16)
1, 4, 9 (sum = 14)
1, 6, 6 (sum = 13)
2, 2, 9 (sum = 13)
2, 3, 6 (sum = 11)
3, 3, 4 (sum = 10)
When the woman tells the deliveryman that the children's ages add up to her street number, he still doesn't know their ages. The only way this could happen is that there is more than one possible way for the children's ages to add up to the number on the house (or else he would have known their ages when he looked at the house number). Looking back at the possible values for the children's ages, you can see that there is only one situation in which there are multiple possible values for the children's ages that add up to the same sum, and that is if their ages are either 1, 6, and 6 (sums up to 13), or 2, 2, and 9 (also sums up to 13). So these are now the only possible values for their ages.
When the woman then tells him that her youngest son has two older brothers (who we can tell are clearly a number of years older), the only possible situation is that their ages are 1, 6, and 6.

cleanlogic100 men are in a room, each wearing either a white or black hat. Nobody knows the color of his own hat, although everyone can see everyone else's hat. The men are not allowed to communicate with each other at all (and thus nobody will ever be able to figure out the color of his own hat).
The men need to line up against the wall such that all the men with black hats are next to each other, and all the men with white hats are next to each other. How can they do this without communicating? You can assume they came up with a shared strategy before coming into the room.

The men go to stand agains the wall one at a time. If a man goes to stand against the wall and all of the men already against the wall have the same color hat, then he just goes and stands at either end of the line. However, if a man goes to stand against the wall and there are men with both black and white hats already against the wall, he goes and stands between the two men with different colored hats. This will maintain the state that the line contains men with one colored hats on one side, and men with the other colored hats on the other side, and when the last man goes and stands against the wall, we'll still have the desired outcome.

logicshort An archeologist claims he found a Roman coin dated 46 B.C. in Egypt. How much should Louvre Museum pay for the coin? Note: Roman coins can really be found in Egypt

Nothing. That coin is as phony as a three dollar bill. In 46 B.C., they wouldn't have known how many years before Christ it was.

logicA man worked for a high-security institution, and one day he went in to work only to find that he could not log in to his computer terminal. His password wouldn't work. Then he remembered that the passwords are reset every month for security purposes. So he went to his boss and they had this conversation:
Man-"Hey boss, my password is out of date."
Boss-"Yes, that's right. The password is different, but if you listen carefully you should be able to figure out the new one: It has the same amount of letters as your old password, but only four of the letters are the same."
Man: "Thanks boss."
With that, he went and correctly logged into his station.
What was the new password?
BONUS: What was his old password?
HINT: It is nine letters long. Also, a "password" can be more than one word...

The old one was: Out of date
The new one is: Different
He said: My password is "Out of date." And the boss told him the new one when he said: "The password is different."