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?

100 prisoners are stuck in the prison in solitary cells. The warden of the prison got bored one day and offered them a challenge. He will put one prisoner per day, selected at random (a prisoner can be selected more than once), into a special room with a light bulb and a switch which controls the bulb. No other prisoners can see or control the light bulb. The prisoner in the special room can either turn on the bulb, turn off the bulb or do nothing. On any day, the prisoners can stop this process and say "Every prisoner has been in the special room at least once". If that happens to be true, all the prisoners will be set free. If it is false, then all the prisoners will be executed. The prisoners are given some time to discuss and figure out a solution. How do they ensure they all go free?

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?

Evil warlock dislikes dwarfs and therefore he selects four of them and buries them. The dwarfs are buried in the ground and they are in such a way that except for their heads, their body is inside the ground. The dwarfs cannot move their body and they can view only forward. They are all buried in a line, and amongst the four, one of the dwarfs is separated by a wall. All the dwarfs are in the same direction. The last dwarfs can see two heads of friends in the front and a wall. In the last second dwarf can see one head of his friend and a wall. The second dwarf can see only the wall. The dwarf can see nothing.
Warlock comprehends the situation and tells the dwarfs that he has placed hats on their heads. There are two blue hats and two red ones. In all four dwarfs, one of them has to say what colour hat he is wearing. If the dwarf says the correct colour of the hat, they will be left free. If the answer is wrong, then they will be dug inside the ground till the very end.

What will be the answer by the dwarf and how will they answer?

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

If you were to put a coin into an empty bottle and then insert a cork into the neck, how could you remove the coin without taking out the cork or breaking the bottle?

You are given with the following sum. Each of the letters can be decoded as a digit. If we tell you that D = 5, then can you solve it entirely?

DONALD
+GERALD
=ROBERT

There is a shop where written:
Buy 1 for $1
10 for $2
100 for $3
I needed 999 and still only paid $3. How could this be financially viable for the shop-keeper?

Below the four parts have been reorganised. The four partitions are exactly the same in both arrangements. Why is there a hole?

Below, you can see three complete equations and one incomplete. Based on the three complete ones, can you complete the incomplete one?

5 $ 4 $ 3 $ 9 = 4215
6 $ 9 $ 2 $ 6 = 3816
4 $ 7 $ 3 $ 3 = 1122
7 $ 2 $ 7 $ 4 = ____