Solution:

First time = 20 ft
Second time = 10ft down + 10 ft up
Third time = 5ft up + 5ft down
It will go on like this the object stops

Total distance traveled = 20 + (10 + 10) + (5 + 5) + (2.5 + 2.5) + . . .
= 20 + (10 + 5 + 2.5 + ...) + (10 + 5 + 2.5 + ...)
Assuming the object comes to rest at infinity,

Total distance traveled = 20 + [10/ (1 - 0.5)] + [10/ (1 - 0.5)]
= 20 + 20 + 20 = 60

Thus option d is correct.

Solution:

If we have to measure precisely, it is impossible. Because we are asked to measure odd number of liters whereas all the jars we have can contain only even liters of water.

* Tricky question asked in ias/infosys/infoedge/ibibo interview

Solution:

What must be kept in mind before you start calculating through any method is that the weights can be put on both the pans.

So the weights - 1, 3, 7, 12, 43, 76, 102

The oldest man that can be weighed using these weights is a man aged 122 years

Solution:

1 2 3 4 5 6 and 7 8 6

Since summation of numbers 1-9(1 2 3 4 5 6 7 8 9) is 45 , so its impossible to divide into two equal parts.
Since we cant flip over 6 to make it 9 but we can flip 9 to make it 6 and hence the solution

Solution:

9

Explanation:
2 < 3 < 5
To find out the required number of candies, take one in place of the least number (i.e. take one mango candy) and then add all the greater numbers (i.e. three strawberry and five pineapple candies) to it.

Required number of balls = 1 + 3 + 5 = 9.

Solution:

It can be solve as shown below.

Solution:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

Solution:

Let us assume that all of them are standing on the X shore and they have to travel to the Y shore.

X = mother, first daughter, second daughter, father, first son, second son, maid and dog
Y = None

Maid and dog go first and maid returns back
X = mother, first daughter, second daughter, father, first son, second son and maid
Y = dog

Maid and first son go and maid returns with dog
X = mother, first daughter, second daughter, father, second son, maid and dog
Y = first son

Father and second son go and father returns back
X = mother, first daughter, second daughter, father, maid and dog
Y = first son and second son

Mother and father go and mother comes back
X = mother, first daughter, second daughter, maid and dog
Y = father, first son and second son

Maid and Dog go and Father returns back
X = mother, first daughter, second daughter and father
Y = first son, second son, maid and dog

Father and Mother go and mother comes back
X = mother, first daughter and second daughter
Y = father, first son, second son, maid and dog

Mother and first daughter go and maid comes back with dog
X = second daughter, maid and dog
Y = mother, first daughter, father, first son and second son

Maid and second daughter go and maid comes back
X = Maid and dog
Y = mother, first daughter, second daughter, father, first son and second son

Maid and dog go
X= none
Y = mother, first daughter, second daughter, father, first son, second son, maid and dog

Thus everyone has reached the other end.

Solution:

Both will rotate at Same speed.

Explanation:
Gears of the same size will always rotate at constant speeds despite any smaller or larger gears in between them.

Solution:

Difference 1
Toy plane direction is different.

Difference 2
On the clock, number 1 & 2 is missing.

Difference 3
The colors of lamp's light is changed.

Difference 4
The ribbon on the gift is missing.

Difference 5
Duck is added in the gift section.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.