Vin Diesel is pulling a theft and has planned to run away with all the cash kept in the safe. But the only way to open the safe is the 13 character password. He has a set of five clues given to him by a trustworthy source.

Exactly two of the below statements are false.
The password is contained within this sentence.
The password is not in this hint.
The password is within only one of these statements.
At least one of the above statements is a lie.

A man had five children. He had $100 with him to give to his children. He decided to start with the youngest child and then give $2 more than each younger child to his next elder child.

For example, if he gives $x to the youngest child, he will give $(x+2) to the next one, $[(x+2) + 2] to the next one and so on.

Can you find out how much did the youngest one receive?

Can you replace the question mark with the correct number in the below table sequence?

What number comes next in the series?

5 15 5 18 5 24 14 20 _

Who can jump higher than a Mountain?

Two Twins Jack and Jill were standing back to back and suddenly they started running in opposite direction for 4 kilometres and then turn to left and run for another 3 kilometres.

what is the distance between the Baggio twins when they stop ?

We know that money can be names differently for the purpose it is used for. Some of the examples of money given at following places or for following activities:

In temple = Daan
In school = Fees
During marriage = Dowry
For divorce = Alimony
Paying government = Tax
In court = Fine
Employer to employee = Salary
To kidnappers = Ransom
For illegal reason = Bribe
To civil servant retirees = Pension

Do you know what do we call the money a husband gives to his wife?

It has a long neck, A name of a bird, Feeds on cargo of ships, It's not alive,

What is it?

I know a 5-digit number having a property that With a 1 after it, it is three times as large as it would be with a one before it.

Guess the number?

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?