Solution:

According to the question
19W + 21B = 562 (where W stands for white bricks and B stands for black bricks)

The easiest way to solve this problem would be putting in the values for W, till we achieve an answer which is divisible by 21.
Why? Because it is must for the statement to be true.

If W = 1
21B = 562 - 19 = 543 i.e. not divisible

If W = 2
21B = 562 - 38 = 524 i.e. not divisible

If W = 3
21B = 562 - 57 = 505 i.e. not divisible

If W = 4
21B = 562 - 76 = 486 i.e. not divisible

If W = 5
21B = 562 - 95 = 467 i.e. not divisible

If W = 6
21B = 562 - 114 = 448 i.e. not divisible

If W = 7
21B = 562 - 133 = 429 i.e. not divisible

If W = 8
21B = 562 - 152 = 410 i.e. not divisible

If W = 9
21B = 562 - 171 = 391 i.e. not divisible

If W = 10
21B = 562 - 190 = 372 i.e. not divisible

If W = 11
21B = 562 - 209 = 353 i.e. not divisible

If W = 12
21B = 562 - 228 = 334 i.e. not divisible

If W = 13
21B = 562 - 247 = 315 i.e. divisible

Thus W must be 13 and if W = 13
B = 315/21 = 15

Thus to form that tower, 13 white bricks and 15 black bricks will be required.

Solution:

The Lady sitting in the chair has the detector attached to the back of her blouse.

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:

8 liters jar: 8; 5 liters jar: 0; 3 liters jar: 0
Fill 5 liters jar entirely.
8 liters jar: 3; 5 liters jar: 5; 3 liters jar: 0
Fill 3 liters jar with 5 liters jar.
8 liters jar: 3; 5 liters jar: 2; 3 liters jar: 3
Pour entirely from 3 liters jar to 8 liters jar.
8 liters jar: 6; 5 liters jar: 2; 3 liters jar: 0
Pour entirely from 5 liters jar to 3 liters jar.
8 liters jar: 6; 5 liters jar: 0; 3 liters jar: 2
Fill 5 liters jar with water from 8 liters jar.
8 liters jar: 1; 5 liters jar: 5; 3 liters jar: 2
Fill the 3 liters jar with water from the 5 liters jar.
8 liters jar: 1; 5 liters jar: 4; 3 liters jar: 3
Empty 3 liters jar in 8 liters jar.
8 liters jar: 4; 5 liters jar: 4; 3 liters jar: 0

Now you have 4 liters of water in 8 liters jar as well as 5 liters jar.

Solution:

It can be solve as shown below.

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

Playing chess

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

Solution:

2 degree below zero

Solution:

Put one black rock in one sack and put all the rest in the other one. In such manner you will get about 3/4 probability of surviving.

Solution:

36 meters.

100/v1 = 80/v2
100/v2 = 80/v3

20+(20/v2)*v3=20+16 = 36

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.