A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.

For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.

Can you find out how much did the youngest one receive?

How many Watermelons are there in the below picture?

How many pluses should we put between the digits of 987654321 to get a total of 99, and where?

John was born on March 5, 1970, in Delhi, India. Jacob was born 25 days before John. The year when they took birth, Republic Day fell on Monday.

Can you find out on what day was Jacob born?

A high school has a strange principal. On the first day, he has his students perform an odd opening day ceremony:

There are one thousand lockers and one thousand students in the school. The principal asks the first student to go to every locker and open it. Then he has the second student go to every second locker and close it. The third goes to every third locker and, if it is closed, he opens it, and if it is open, he closes it. The fourth student does this to every fourth locker, and so on. After the process is completed with the thousandth student, how many lockers are open?

John is selling fruits.
He sells grapes at $30, Dates $25, and a Wolfberry $45.
At what price does he sell fig?

PS: Logical Thinking

When Jack was six years old he hammered a nail into his favourite tree to mark his height. Ten years later at age sixteen, Jack returned to see how much higher the nail was. If the tree grew by five centimetres each year, how much higher would the nail be?

Christina has four daughters, and each of her daughters has a brother. How many children does Christina have?

What word is represented by this rebus?

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?