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?

Which digit occurred maximum times between the number 1 and 1000?

Decode below three cipher riddles:

26 L of the A
7 D of the W
1000 Y in a M

When it's bad luck to meet a black cat?

It's pretty hard to give up.
If you remove a part of it, you will be left with a bit.
Even if you remove another part, the bit still remains.
Remove one more and it still remains.

What is it?

How many points are there on the globe where, by walking one mile south, then one mile east and then one mile north, you would reach the place where you started?

I can turn polar bears white.
I can make anyone dance.
I can make everyone cry
I can make your hands clap
I can make you thin.
I can make you smile.
I can make you smile

Can you guess the riddle?

John and Jill are madly in love with each other. To remind Jill of his pure love, John wants to send her a ring by post but in their country where burglary is quite prominent, any package that is not locked comes under the risk of being stolen for the contents.

John and Jill possess many padlocks but neither one of them has the other key.

Can you find a way John can send the ring to Jill safely?

During an experiment, a guy throws a bouncy ball from a 100 feet tall building. The ball has a specific characteristic. Every time it hits the ground, it bounces up halfway.

How many bounces do you think the ball will make before it comes to a stop ?

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?