Solution:

We can calculate out how many days there will be for the 13th on each month if we count from the beginning of the year (January 1). Then we divide total days by 7 to get the remainders. We also need to consider the leap year. Through the whole year we had all kinds of remainders, from 0 to 6. The minimum of occurence for all the unique remainders was 1. It means that we have at least one Friday on 13th. In a regular year, the best chance you can get 3 Fridays on 13th, which are in February, March and December because the remainders of these 3 months are 2. In a leap year, the best chance you also can get 3 Fridays on 13th, which are in January, April and July because the remainders of these 3 months are 6.

Solution:

To do this, he must be pushing the cork inside the bottle and then taking out the coin.

Solution:

A typical way will be to start thinking about summing up the distance that the bee will travel but that will be quite a tedious task. How about we offer you a much easy solution?

The tunnel is 200 miles long and the trains are running at as peed of 100 mph which means that they will collide exactly at the center of the tunnel and seeking their speed, they will collide after an hour.

Now consider the bee which is flying at a speed of 1000 mph and will keep flying till the train collides. As calculated, it will keep flying for an hour which means the distance that it will cover is 1000 miles.

Solution:

LOTTO

Explanation:
Just flip the two rows 1 and 2 vertically, you will find the word "Lotto".

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:

Playing chess

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

Solution:

The check was for dollars 31.63.

The bank teller gave her dollars 63.31
She spent .05, and then she had dollars 63.26, which is twice the check.

Let x be the dollars of the check, and y be the cent.

The check was for 100x + y cent
He was given 100y + x cent

Also
100y + x - 5 = 2(100x + y)
Expanding this out and rearranging, we find:
98y = 199x + 5

or 199x ≡ -5 (mod 98)
or 98*2*x + 3x ≡ -5 (mod 98)
3x ≡ -5 ≡ 93 (mod 98)
this quickly leads to x = 31

Solution:

Take 10 number of cards in a new deck and change their face direction. For example- You create a new deck of 10 cards and out of 10, 3 faces up in the new deck. So remaining 7 faces up are in the old deck. But hey! while creating the new deck you reversed the face direction of new cards. So actually the 3 cards which were facing up are actually face down in the new deck while 7 faces up.

Solution:

Treasure Map Is Hidden Inside The Hanging Room Floor.

Explanation.
Just reverse the text "roolF mooR gnignaH ehT edisnI neddiH sI paM erusaerT".

Solution:

What must be kept in mind before you start calculating through any method is that the weights can be put on both the pans.

So the weights - 1, 3, 7, 12, 43, 76, 102

The oldest man that can be weighed using these weights is a man aged 122 years

Solution:

It can be done in 8 moves as shown in the animated image below.