Which part of London exists in France as well ?

A little girl goes to the store and buys one dozen eggs. As she is going home, all but three break. How many eggs are left unbroken?

In the picture that is attached with this question, you can find a square which comprises of four little squares inside it. Consider this square to be made with matchsticks. You have to remove two matchsticks such that only two squares remain instead of five.How will you do it ?

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

Can you find out the missing number?

? 4 5 3 5

9 5 7 10 3

Which tank will fill first?

Identify the 10 differences between the two given pictures.

Role Action
Block Prevents the target player from acting
Redirect Change target player target.
Save Protects the target player from death.
Seer Sees all actions that occurred
Murderer Kills the target player

The following five players are playing:

Andy
Brian
Chris
Daniel
Fred

You are Andy the Seer and you saw the following things:
a) Brian was redirected to Chris.
b) Chris was blocked.
c) Daniel was killed.

Who is the murderer then?

Can you find a seven digit number which describes itself. The first digit is the number of zeros in the number. The second digit is the number of ones in the number, etc. For example, in the number 21200, there are 2 zeros, 1 one, 2 twos, 0 threes and 0 fours.

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?