John can eat 27 chocolates in an hour, Jacob can eat 2 chocolates in 10 minutes, and Jolly can eat 7 chocolates in 20 minutes. How long will it take them to share and eat a box of 120 chocolates whilst playing Chess?

I am eight letters long - "12345678"
My 1234 is an atmospheric condition.
My 34567 supports a plant.
My 4567 is too appropriate.
My 45 is a friendly thank-you.
My 678 is a man's name.

What word am I?

A father's child, a mother's child, yet no one's son.

Who am I?

The following question it puts forth you:

25 - 55 + (85 + 65) = ?

Then, you are told that even though you might think it's wrong, the correct answer is actually 5!

Whats your reaction to it? How can this be true?

You need to climb ten stairs. At every stair, you can either take one step up or you can jump two steps up.

In how many different ways you can climb 10 stairs?

You have two jars of chocolates labelled as P and Q. If you move one chocolate from P to Q, the number of chocolates on B will become twice the number of chocolates in A. If you move one chocolate from Q to P, the number of chocolates in both the jars will become equal.

Can you find out how many chocolates are there in P and Q respectively?

I have an apple tree , number of apple in this tree get doubles every week.

On 30th week , the tree gets completely filled with apples :-)



Can you tell me , on what week does my tree is half covered with apples ?

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?

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?

Complete the series by replacing "?" with the correct number.

ST ND RD TH '?'