Solution:

The women is a of short stature. She can't reach the upper elevator buttons, but can push is with his umbrella.

Solution:

Four

As the window was closed it is obvious that the six candles that were not extinguished were lit till they melted away entirely. Thus only four candles that were extinguished remain at the end.

Solution:

None

The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.

Solution:

mother

We know from (3) that the youngest person was not the victim, from (4) that the youngest person was not the helper and from (6) that the youngest person was not the killer. The youngest person can only have been the witness therefore. If we make up a chart there are now three possible combinations:

Oldest person (father) H H M

Next to oldest (mother) V M H

Next to youngest (son) M V V

Youngest (daughter) W W W

(H = Helper ; V = Victim ; M = Murderer ; W = Witness)

We can work out from (5) that the father was the oldest, from (2) that the youngest person must have been the daughter. Therefore the next to the youngest must have been the son and the next to the oldest, the mother.

Solution:

111111111

Explanation:
It's a maths magical square root series as :
Square root of number 121 is 11
Square root of number 12321 is 111
Square root of number 1234321 is 1111
Square root of number 123454321 is 11111
Square root of number 12345654321 is 111111
Square root of number 1234567654321 is 1111111
Square root of number 123456787654321 is 11111111
Square root of number 12345678987654321 is 111111111 (answer)

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:

The person on 73rd number will survive.

Explanation:
Till the number is the power of 2, the last person to survive will be the one who started it. But since the number here is not the power of 2, we will take the greatest power of 2 that is less than the number which is 64.
100 - 64 = 36
36 people are killed as 2, 4, 6, ..., 72. Thus the sword will now be given to the 73rd person. Now he is the first person to start in the remaining 64 people. Thus he will be the one to survive.

Solution:

The last marble will be yellow.

Since marbles can only be taken out in pairs and you started off with an odd number of yellows there is always going to be one yellow left over that you'll keep putting back in the box until it's left on it's own.

Solution:

The bridge won't break.

When the car has travelled half of the bridge, that is 15km, the car must have used more than 300 grams of fuel. Therefore, the impact of bird's added weight will be zero literally.

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:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.