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?
There are two dice with empty faces in front of you and a marker. You can mark any number on each of the faces of the two dice, but you have to display all 31 days of the month using the two of them.
Which numbers will you mark on which dice so that you can easily depict all the dates of the month?
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.
A spaceship was lost. The detective was given a piece of paper. This was the location of the spaceship! This is what the slip had scribbled on it:
Juice, Umbrella, Potato, Ice, Tomato, Elephant, Rice.
I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:
First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.
