Solution:

If you are thinking to hold one chocolate from each box in hand and then balancing weight in bare hands, you are thinking all wrong.

Let us begin by labelling boxes as 1, 2, 3 and so on till 10.

Now pick one chocolate from box 1, two chocolates from box 2, three from box 3 and so on. In total, you will have 55 chocolates now. (1 + 2 + 3 + ..... + 10)

The ideal weight of the chocolates should be 55 * 20 = 1100. However, somewhere in there are the defected chocolate/s.

You can judge that clearly by noting down the result of 1100 - total weight of chocolates. If the weight is less than 1 gram, the defected box is box 1, if the weight is less than 2 grams, the defected box is box 2 and so on.

Solution:

Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules

Solution:

Playing chess

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

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:

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:

A) Fill 5 ml gallon ( 5mlGallon - 5, 3mlGallon - 0)
B) Transfer to 3 ml gallon (5mlGallon - 2, 3mlGallon - 3)
C) Empty 3 ml gallon ( 5mlGallon - 2, 3mlGallon - 0)
D) Transfer 2 ml from 5 ml gallon to 3 ml gallon (5mlGallon - 0, 3mlGallon - 2)
E) Fill 5 ml gallon(5mlGallon - 5, 3mlGallon - 2)
F) Transfer 1 ml from 5 ml gallon to 3 ml gallons(5mlGallon - 4, 3mlGallon - 3)

Solution:

It is best if the person sits on the back of the train. After the stop, the train will be accelerating as it goes into the tunnel. Thus the train will be much master when the back of the train enters the tunnel. In this way, he will have to spend much less time in the tunnel.

Solution:

Think deeply about the door number 56, people will visit it for every divisor it has. So 56 has 1 & 56, 2 & 28, 4 & 14, 7 & 8. So on pass 1, the 1st person will open the door; pass 2, 2nd one will close it; pass 4, open; pass 7, close; pass 8, open; pass 14, close; pass 28, open; pass 56, close.
Thus we can say that the door will just end up back in its original state for each pair of divisor. But what about the cases in which the pair of divisor has analogous number for example door number 16? 16 has the divisors 1 & 16, 2 & 8, 4&4. But 4 is recurrent because 16 is a perfect square, so you will only visit door number 16, on pass 1, 2, 4, 8 and 16… leaving it open at the end. So only perfect square doors will remain open at the end.

Solution:

Sansa has the siamese (conjoined) twin sister.

Solution:

If you see the picture, they formed a pentagonal shape and achieved the required.