John, Jack and Jill are in a desert. John doesn't like Jill and hence decides to murder him. He poisons the water supply of Jill. Since it is a desert area, Jill must drink or he will die of thirst.

Jack does not know of the actions of John and also decides to murder Jill. To succeed in his ill motives, he removes the water supply of Jill so he dies of thirst.

Jill dies due to thirst. Who murdered Jill?

In a family supper, a grandfather, a grandmother, two fathers, two mothers, four children, three grandchildren, one brother, two sisters, two sons, two daughters, one daughter-in-law, and one mother-in-law need to sit at a table.

There are only seven chairs available at the place. How many more chairs do they have to borrow so that everyone can sit down together for the suppers if everybody requires a separate chair?

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?

There is an ancient kingdom where every married woman keeps information regarding the fidelity of other men. However, what they don't know is the fidelity of their own husbands. Also, there is an ancient belief that they don't tell each other about the fidelity of their husbands.

On a certain day, the queen of the kingdom declares that she has identified at least one unfaithful man in the kingdom. She allows the wives to identify and gives them authority to kill their husbands if they are unfaithful at midnight.

How will the wives manage it?

Find a 9-digit number, which you will gradually round off starting with units, then tenth, hundred etc., until you get to the last numeral, which you do not round off. The rounding alternates (up, down, up ...). After rounding off 8 times, the final number is 500000000. The original number is commensurable by 6 and 7, all the numbers from 1 to 9 are used, and after rounding four times the sum of the not-rounded numerals equals 24.

Three men in a cafe order a meal the total cost of which is $15. They each contribute $5. The waiter takes the money to the chef who recognises the three as friends and asks the waiter to return $5 to the men.

The waiter is not only poor at mathematics but dishonest and instead of going to the trouble of splitting the $5 between the three he simply gives them $1 each and pockets the remaining $2 for himself.

Now, each of the men effectively paid $4, the total paid is therefore $12. Add the $2 in the waiters pocket and this comes to $14. Where has the other $1 gone from the original $15?

Two boys wish to cross a river. The only way to get to the other side is by boat, but that boat can only take one boy at a time. The boat cannot return on its own, there are no ropes or similar tricks, yet both boys manage to cross using the boat.

How?

The great emperor Akbar once ruled India. He was well known for his intelligence. But along with that, he was known for the Nine Gems in his court. One of the nine gems was Birbal, a quick witted and extremely intelligent man. The stories of his wit were widely popular.

Once a king ruling in a distant land heard of Birbal. To check his wit, he sent an invitation and called him to visit his land. Akbar allowed Birbal to go and he took off on the journey.

Upon reaching that kings kingdom, he was welcomed with flowers. He was then escorted to the palace of the king. Upon entering the palace, Birbal found that there were six people sitting in front of him adorning the same robe. They were also lookalike and it was hard to judge who the real king was.

After a couple of minutes, Birbal approached one of them and bowed in front of him greeting him.

That was the real king. How did Birbal know who was the real king ?

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?

What brings you down but never up?