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?

Two batsman each on 94 runs. Seven runs needed to win in last 3 balls. Both make 100*. How?

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

Find The Next Number in the series:

12 13 15 17 111 113 117 119 123 ?

Can you find the odd number in the following five choices?

1) 482636
2) 259807
3) 865195
4) 104739
5) 391744

Using the clues below, what four numbers am I thinking of?

The sum of all the numbers is 31.
One number is odd.
The highest number minus the lowest number is 7.
If you subtract the middle two numbers, it equals two.
There are no duplicate numbers.

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?

Solve the equation in the image by looking at the pattern closely.

Replace the question mark in the picture below.

You have four chains. Each chain has three links in it. Although it is difficult to cut the links, you wish to make a single loop with all 12 links. What is the fewest number of cuts you must make to accomplish this task?