Solution:

Flat Tyre

Solution:

Playing chess

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

Solution:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.

Solution:

XIX is the answer which refers to nineteen in roman numeric system. On taking out one i.e. I, we will get XX that is equal to twenty.

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:

One Night Stand.

Explanation:
Number 'One' + Knight(chess piece) + st + and(symbol &)

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:

28 =>1+2+4+7+14

cannot be 1 (as number cannot be included)

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.

Solution:

There is no mention if you can use sign or not and thus the only possible way to get this is as follows:

(15 - 9) + (13 - 7) + (7 - 1) + (9 - 1) + (13 - 9)

If you solve inside the brackets, you will get the following equation
6 + 6 + 6 + 8 + 4
Adding all these numbers, you will get 30 which is the required sum.

Solution:

Just One!

example
If u get Blue rock with label as "blue+red" => this is red as all labels are wrong.
In this way u can logically solve this puzzle.