A boy collects white seashells from the sea and brings them home every night. When he has enough of them, he decides to sell them to a trader.

The trader is ready to buy the shells and he asks the boy about the quantity. At this, the boy starts calculating. He has a giant box that contains 3 mini boxes. Two of them have another mini box inside. If the giant box can hold 50 shells, how many brown shells can he sell to the trader?

While house hunting in London, I came across a very good leasehold property Discussing the lease the landlady told me:

'The property was originally on a 99 years lease and two-thirds of the time passed is equal to four-fifths of the time to come. Now work it out for yourself and see how many years are to go!

What is full of holes but still holds water?

What goes up but never comes down?

One day, all the courtiers from Akbar's court were gathered in the assembly hall when one of them told the Emperor that all his valuables had been stolen by a thief the previous night.
This shocked the Emperor to his core as the place where that courter stayed was the most secured in the kingdom. The Emperor thought that it is not at all possible for an outsider to enter into the courtier's house and steal the valuables. Only another courtier could commit this crime. He quickly called Birbal to identify the thief.
Birbal thought for a while and successfully solved the mystery by identifying the thief in just one statement.
What did Birbal say?

Can you count the number of matches in the picture below ?

It's a protector.
It sits on a bridge.
One individual can see directly through it, while others wonder what it hides.

What is it?

Below, you can see some coding:
January = 1017
February = 628
March = 1335
April = 145
May = 1353
June = 1064
July = 1074
August = 186

Now deciphering the way it has been coded, can you find out how September will be coded?

If a shopkeeper can only place the weights on one side of the common balance. For example, if he has weights 1 and 3 then he can measure 1, 3 and 4 only. Now the question is how many minimum weights and names of the weights you will need to measure all weights from 1 to 1000? This is a fairly simple problem and very easy to prove also.

What has many keys but can’t open a single lock?