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:

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:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

Solution:

For this answer is 3^0, 3^1, 3^2... That is 1,3,9,27,81,243 and 729.

Solution:

10

Explanation:
Equation 1 + 9 + 11 = 1 can be derived from
One (o) + nine (n) + eleven (e) = one => 1

Similarly for equation,
12 + 11 + 9
Twelve (t) + eleven (e) + nine (n) => ten (10)

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:

The probability of two numbers being relatively prime is 60%. Thus if you keep playing the bet, you will hypothetically make 20 cents on every play.

Thus, you should accept the bet.

Solution:

Steps:
1) Light fire on first bar from both the ends and second bar from one end.

2) After 30 seconds(when first bar gets completely burned out) , burn the second bar from second end as well.

3) When second run completely gets burned , you know its 45 seconds.

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:

Tilt the barrel until the fruit juice barely touches the lip of the barrel. If the bottom of the barrel is visible then it is less than half full.If the barrel bottom is still completely covered by the fruit juice, then it is more than half full.

Solution:

It has been clearly mentioned that all the boxes are labeled incorrectly. If he opens the Box3, then he will get either Dark Chocolates or Milk Chocolates as it is labeled incorrectly. Let us suppose he finds Dark Chocolates in there. Now since all are labeled incorrectly, Box B A must contain Milk Chocolates and Box B must contain Milk Chocolates and Dark Chocolates.