Always in you, Sometimes on you;

If I surround you, I can kill you.

What am I?

Count the number of times the letter "F" appears in the following paragraph:

FAY FRIED FIFTY POUNDS OF
SALTED FISH AND THREE POUNDS
OF DRY FENNEL FOR DINNER FOR
FORTY MEMBERS OF HER FATHER'S FAMILY.

In the Mexico City area, there are two Houses H1 and H2. Both H1 and H2 have two children each.
In House H1, The boy plays for Mexico Youth academy and the other child plays baseball.
In House H2, The boy Plays soccer for his school in Mexico and they recently have a newborn.

Can you prove that the probability of House-H1 having a girl child is more than that of House-H2?

Can you move 2 matchsticks to form four equal sized squares.

The captain of a ship is telling you an interesting story and then poses a question. He says, “I have travelled the oceans far and wide. One time, two of my sailors were standing on opposite sides of the ship. One was looking west and the other one east. And at the same time, they could see each other clearly. Can you tell me how that was possible?”

Jenifer is learning to drive her car. She went down a one way lane and in the wrong direction. But she do not break any law.

How come ?

Can you fill the blank with the correct number?

6 30 870 756030 _____

In a town, there are four houses located at different distances from each other. Following are the distances:

The third house is 60 meters apart from the first house.
The fourth house is 40 meters apart from the second house.
The third house is 10 meters nearer to the fourth house than it is to the second house.

Can you find out the distance between the fourth and the first house?

An infinite number of mathematicians are standing behind a bar. The first asks the barman for half a pint of beer, the second for a quarter pint, the third an eighth, and so on. How many pints of beer will the barman need to fulfill all mathematicians' wishes?

In the picture, you can see a chess board. On the top left position, the K marks a knight. Now, can you move the knight in a manner that after 63 moves, the knight has been placed at all the squares exactly once excluding the starting square?