Solution:

Adam and Eve were the only people without navel. As they were not born out of a mother, they never had umbilical cords and thus never had navels.

Solution:

When you were inside the shed, the murderer replaced the lock with his own one that was identical to your original lock. When you locked the store room, you did not require a key and there was nothing abnormal for you. When you left, the murderer opened the lock with his key, planted the dead body inside and replaced the lock again putting the original lock in the place. He then closed it without any problem.

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:

Ms. Britney did it.

We will take up every person and analyze the statements over all of them one by one.

Case 1: Ms. Britney did it, then
Statement 1 => true
Statement 2 => false (as Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
Our first guess itself was right but let us confirm our analysis by analyzing the statements over others.

Case 2: Ms. Rihanna did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => true
Statement 3 => true (as Ms. Britney is not lying)
As per the conditions, three statements had to be wrong but here, we have two statements right which clearly contradict the condition.

Case 3: Ms. Gwyneth did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
She did not do it as all the statements are false.

Case 4: Ms. Yoon did it, then
Statement 1 => false (as Ms. Britney did not do it)
Statement 2 => false (as Ms. Rihanna did not do it)
Statement 3 => false (as Ms. Britney is lying)
Statement 4 => false (as Ms. Gwyneth is lying)
All four statements are false in her case as well thus she did not do it.

Therefore we have proved that Ms. Britney did it.

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:

The girl was born on 29 February. Thus her birthday came once in four years only while her sister was born on a normal day and celebrated her birthday every year. Thus the girl had a chance of depositing money only 10 times in 4 years through which she collected $2500 while her sister took $50 from the piggy bank every year making the total amount to be $2000. Thus when the piggy bank was opened, it had just $500.

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 answer is very simple. All she had to do is take the fifteen cards from the top and reverse them. This would make another pile out of that and there will be two piles - one of 15 cards and one of 37 cards. Also both of them will have the same number of inverted cards.

Just think about it and if the mathematical explanation will help you understand better, here it is.
Assume that there were p inverted cards initially in the top 15 cards. Then the remaining 37 cards will hold 15-p inverted cards.
Now when she reverses the 15 cards on the top, the number of inverted cards will become 15-p and thus the number of inverted cards in both of the piles will become same.

Solution:

You must put labels on the tablets as A and B before using. In that case, if you pour tablets together, you will get 3A, 2A 1B, 1A 2B or 3B. If they are from the same bottles you can take one from another bottle and save the remaining two for another day. If you get two from same and one from other, you can draw one from another bottle and you will have two pairs of which you can eat one and save the other.

Solution:

There are two things to keep in mind:
Firstly there is at least one red hat. (There can be two or three as well).
Secondly the competition is fair for everyone.

Thus if there is only one red hat, that person will see two green hats on other heads and will be able to deduce his own color as red. However the other students will see one red and one green hat and can never be sure. In such manner, the competition will prove to be partial for one student.

Suppose if there are two red hats. Then the students who are wearing red hats will see one red and one green hat on others. Now they must have deduced that there can’t be just one red hat. Thus they will know that they are also wearing a red hat. But the one who is wearing a green hat will see two red hats and can never be sure of his own color. In this case as well, the competition will not be fair.

Thus the only possible and fair means is if all of them are wearing a red hat. The one who is able to deduce the situation first, will raise his hand and will tell the correct answer.