I have thought of a number that is made up by using all the ten digits just once. Here are a few clues for you to guess my number:

First digits is divisible by 1.
First two digits are divisible by 2.
First three digits are divisible by 3.
First four digits are divisible by 4.
First five digits are divisible by 5.
First six digits are divisible by 6.
First seven digits are divisible by 7.
First eight digits are divisible by 8.
First nine digits are divisible by 9.
The number is divisible by 10.

Can you find out the number ?

A research team went to a village somewhere between the jungles of Africa. Luckily for them, they reached the day when quite an interesting custom was to be performed. The custom was performed once a year as they confirmed and was performed in order to collect the taxes from every male of the region.

The taxes were to be paid in the form of grains. Everyone must pay pounds of grain equaling his respective age. This means a 20-year-old will have to pay 20 pounds of grain and a 30-year-old will pay 30 pounds of grain and so on.

The chief who collects the tax has 7 weights and a large 2-pan scale to weigh. But there is another custom that the chief can weigh only three of the seven weights.

Can you find out the weights of the seven weights? Also, what is the maximum age of the man that can be weighed for the payment of taxes?

A word I know,
Six letters contain,
Subtract just one,
And twelve is what remains.

Mother's Name is Mrs. SIXTY TWO
Son's Name is FIFTY TWO
Daughter's Name is FORTY TWO
What is Name of Father?

There is a wide field of corn. A goose finds its way into the field and starts running. Can you find out till which point the goose can run into the field?

When I get multiplied by any number, the sum of the figures in the product is always me. What am I?

When can we add 2 to 11 and get 1 as the correct answer?

John leaves home and then he takes three right turns. John wants to return to home but he was scared of Jacob, who is wearing a mask.

What is John Situation ?

Analyze and find the missing item in the sequence:
16, 06, 68, 88, __, 98

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?