How many people must be gathered together in a room, before you can be certain that there is a greater than 50/50 chance that at least two of them have the same birthday?

What goes through cities and fields, but never moves?

What English word has three consecutive double letters?

You are an expert on paranormal activity and have been hired to locate a spirit haunting an old resort hotel. Strong signs indicate that the spirit lies behind one of four doors. The inscriptions on each door read as follows:

Door A: It's behind B or C
Door B: Its behind A or D
Door C: It's in here
Door D: It's not in here

Your psychic powers have told you three of the inscriptions are false, and one is true. Behind which door will you find the spirit?

If Japan and Panama decided to merge into a single country, probably people will name it Japanama.

Can you think of two more such country's unions that could produce similar names like Japanama by overlapping their three letters?

In front of you, there are 9 coins. They all look absolutely identical, but one of the coins is fake. However, you know that the fake coin is lighter than the rest, and in front of you is a balance scale. What is the least number of weightings you can use to find the counterfeit coin?

Until it is measured, not known. Yet how you miss it when it has gone. What is it?

Find three whole, positive numbers that have the same answer when multiplied together as when added together.

Vin Diesel is pulling a theft and has planned to run away with all the cash kept in the safe. But the only way to open the safe is the 13 character password. He has a set of five clues given to him by a trustworthy source.

Exactly two of the below statements are false.
The password is contained within this sentence.
The password is not in this hint.
The password is within only one of these statements.
At least one of the above statements is a lie.

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?