You have a thousand Re. 1 coins with you. You have ten bags with you and you can put any number of coins in each of the bags. The condition is that if someone asks you for any amount between 1 and 1000, you must be able to give that amount by just giving the bag (you are not allowed to open the bag and give coins).

How will you do it?

Solve the alphametic puzzle by replacing the alphabet with the number.

S T O R M +
S O L E S
=========
T O W E L
=========

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.

Replace the question mark with the correct number in the below-given picture?

In particular commonwealth games, a female participant won silver and gold medals for a single event.

How can this be possible?

You have two strings whose only known property is that when you light one end of either string it takes exactly one hour to burn. The rate at which the strings will burn is completely random and each string is different. How do you measure 45 minutes?

There are seven sisters in a house in a village where there is no electricity or any gadget.

Sister-1: Reading Novel
Sister-2: Cooking
Sister-3: Playing Chess
Sister-4: Playing Sudoku
Sister-5: Washing clothes
Sister-6: Gardening

what is Sister-7 doing ?

You have two buckets - one holds exactly 5 gallons and the other 3 gallons. How can you measure 4 gallons of water into the 5 gallon bucket?

(Assume you have an unlimited supply of water and that there are no measurement markings of any kind on the buckets.)

I inserted a coin in a bottle and closed its mouth with the help of a cork. Now, I was able to take the coin out from the bottle without taking out the cork or breaking the bottle. Can you tell me how I did it?

Nodes are shown below and you need to connect them based on the following rule: Every node can be connected to the number of nodes inside them, i.e. the first node there is a value of 1 which indicates that the first node can connect to exactly one node only.Can you do it?