I have two coins.
* One of the coins is a faulty coin having a tail on both sides of it.
* The other coin is a perfect coin (heads on side and tail on other).

I blindfold myself and pick a coin and put the coin on the table. The face of the coin towards the sky is the tail.

What is the probability that another side is also tail?

It has five wheels, though often think four, You cannot use it without that one more, You can put things in it, you can strap things on top, You can't find it in the market, but you can still go shop. What is it?

You are playing a game with your friend Jack. There are digits from 1 to 9. You both will take turn erasing one digit and adding it to your score. The first one to score 15 points will win the game.

Would you want to play first or second?

PS: The sum should be exactly 15.

A dying old man wants to divide his entire land between his only two sons. Since his only wish is to treat them as equal as both of them have been too good to him, he wants to divide his land equally between them. The problem is that the land is significantly irregular in shape and thus there is no choice of cutting them into two equal halves.

Can you help him divide the land in a manner that both of his sons will be happy?

Four people need to cross a rickety bridge at night. Unfortunately, they have only one torch and the bridge is too dangerous to cross without one. The bridge is only strong enough to support two people at a time. Not all people take the same time to cross the bridge. Times for each person: 1 min, 2 mins, 7 mins and 10 mins. What is the shortest time needed for all four of them to cross the bridge?

A boy was locked in a room by some robbers. All that is in the room is a piano, a calendar, and a bed. The room is locked from the outside. What does he eat, drink, and how does he escape and get out?

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?

Our product and our sum always give the same answer. Who are we?

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.

Can you find the odd number in the following?

2716, 4135, 5321 and 7145