A bag contains 64 balls of eight different colours. There are eight of each colour (including red). What is the least number you would have to pick, without looking, to be sure of selecting 3 red balls?

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 is the riddle which can be asked all day with a different correct answer each time.

Queen Elizabeth organised a royal party.

To Avoid uninvited guest royal family set a password.
Jack (an uninvited person) plan to enter the party. He stand nearby the door.

First guest comes, the security person said 'twelve' and guest replied with six.
Second guest comes , the security person said 'six' and guest replied with 'three'.

Jack thought is enough and he walked to the entry point. The security person said 'eight' , Jack replied smilingly 'four'.
He was immediately thrown out of the party. why ?

A word I know has six letters it contains, remove one letter and 12 remain. What is it?

The following alphametic has only one solution. Can you find it?
ENLIST + SILENT + LISTEN = ANAGRAM

PS: You may start the number from 0.

In a kingdom, King George did not allow any citizen to visit the world outside. Also, only a person with proper paperwork was allowed to enter or he was sent back. A wooden bridge was what connected the kingdom to the world. The king had appointed a sharpshooter who would check the every five minutes on the bridge to check. After checking, he would go back to his hut and return exactly after five minutes again. The bridge took 9 minutes to cross.

A merchant was able to escape the kingdom without harming the shooter. How?

What has a ring but no finger?

Where do you go to learn how to make ice cream?

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?