Solution:

The minimum number of drops required are eight.

We will begin from the floor 8. And then if it does not breaks, we will continue in the following fashion

8, (8+7), (8+7+6), (8+7+6+5), (8+7+6+5+4), (8+7+6+5+4+3), (8+7+6+5+4+3+2), (8+7+6+5+4+3+2+1)

= 8, 15, 21, 26, 30, 33, 35, 36

Suppose if the egg breaks from 20th floor
It will not break from eights
It will not break from fifteenth
It will break from twenty first
You will still have one egg remaining

Now start putting from sixteenth floor moving up one floor every time
It will not break till nineteenth and it will break of twentieth floor.

For the worst scenario possible, the maximum number of droppings will be eight only.

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.

So either A or B will speak up first depending on the situation.

Solution:

The answer is 2. First, divide the coins into 3 equal piles. Place a pile on each side of the scale, leaving the remaining pile of 3 coins off the scale. If the scale does not tip, you know that the 6 coins on the scale are legitimate, and the counterfeit is in the pile in front of you. If the scale does tip, you know the counterfeit is in the pile on the side of the scale that raised up. Either way, put the 6 legitimate coins aside. Having only 3 coins left, put a coin on each side of the scale, leaving the third in front of you. The same process of elimination will find the counterfeit coin.

Solution:

This problem can be solved with algebra as well as logical reasoning. We are going to tell you how it is logically possible.

Be it any quantity that was present in the beginning and any liquid as well. We know that we have taken a spoonful from one glass and put it into another. Then, we have taken a spoonful from the other glass and put it into the first glass. So, at the end of it, the quantity of liquid in either glass remains same as it was in the beginning.

Therefore, we can conclude the fact that any amount of coke that is missing in the glass with coke will be present in the lemonade glass. Also, the same quantity of lemonade will be missing from the lemonade glass and will be present in the coke glass.

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:

1. Fill 5 liters jar ( 5l-jar:5, 3l-jar:0)
2. Transfer to 3 liters pail (5l-jar:2, 3l-jar:3)
3. Empty 3 liters jar ( 5l-jar:2, 3l-jar:0)
4. Transfer 2q from 5 pail to 3 pail (5l-jar:0, 3l-jar:2)
5. Fill 5 liters pail(5l-jar:5, 3l-jar:2)
6. Transfer 1q from 5 pail to 3 pail(5l-jar:4, 3l-jar:3)

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:

146900

Explanation:
Whenever you face such type of questions, it is wise to begin from the last thing. Here in this question the last thing will be the 9th temple. He climbed down 100 steps and thus you know, he had Rs. 100 before beginning climbing down. Thus, he must have offered Rs. 100 to the god in that temple too (he offered half of the total amount). Also, he must have dropped Rs. 100 while climbing the steps of the ninth temple. This means that he had Rs. 300 before he begand climbing the steps of the ninth temple.

Now, we will calculate in the similar manner for each of the temples backwards.
Before the devotee climbed the eight temple: (300+100)*2 + 100 = 900
Before the devotee climbed the seventh temple: (900+100)*2 + 100 = 2100
Before the devotee climbed the Sixth temple: (2100+100)*2 + 100 = 4300
Before the devotee climbed the fifth temple: (4300+100)*2 + 100 = 8900
Before the devotee climbed the fourth temple: (8900+100)*2 + 100 = 18100
Before the devotee climbed the third temple: (18100+100)*2 + 100 = 36,500
Before the devotee climbed the second temple: (36500+100)*2 + 100 = 73300
Before the devotee climbed the first temple: (73300+100)*2 + 100 = 146900

Therefore, the devotee had Rs. 146900 with him initially.

Solution:

The 100th statement for sure is incorrect because it says that at least 100 of the statements are incorrect.

Suppose if that is correct, then 100 statements cannot be true.
This suggests that the 100th statement is incorrect and that the first statement is true.

Similarly 99 statements cannot be true because if they were true, then two statements would become correct i.e. the 1st and the 99th.
But the 99th statement says that at least 99 are incorrect.
This suggests that the 99th statement is incorrect and that 2ndone is true.

If we keep analyzing is the same way till the end, we will find out that only the first fifty statements are true and all the remaining ones are incorrect.

Solution:

Playing chess

Game needs two players so Brother-8 is playing chess with Brother-2