Solution:

The total population of New York City is about nine millions. Let us assume that 1 million among them are bald which leaves us with eight millions of people that are required to have different number of hairs on their head.

Now as per the surveys, on an average, people have 100, 000 hairs on their head. Since all must have different numbers, we start with one. Let us say someone has one hair strand, someone has two, and someone has three and so on. After 100, 000 people, we are left with 7, 900, 000 people left. Since all of them are needed to have different number of hair strands, we will move up from 100, 000.

In such case, at the end, you will be having a person with 8, 000, 000 hairs which is clearly impossible (even having 1, 000, 000 hairs on someone's head is impossible).

Therefore, there must be two people who have same number of hairs on their head.

This is a classic example of the pigeonhole principle.

Solution:

Solution is below

Solution:

It can be done as shown in the picture below.

Solution:

2 people

Say 2 helpers are Helper1 & Helper2

Helper1 food Helper2 food McDuck's Food
End of Day 1 : 1 4 4
Now 'A' will head back

End of Day 2 : N/A 2 4
Now 'B' will head back

Now Mr. McDuck have 4 day food :-)

Solution:

It is best if the person sits on the back of the train. After the stop, the train will be accelerating as it goes into the tunnel. Thus the train will be much master when the back of the train enters the tunnel. In this way, he will have to spend much less time in the tunnel.

Solution:

28 =>1+2+4+7+14

cannot be 1 (as number cannot be included)

Solution:

The woman told him to take out one nut each from the rest of the wheels and use them.

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:

XIX is the answer which refers to nineteen in roman numeric system. On taking out one i.e. I, we will get XX that is equal to twenty.

Solution:

Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules

Solution:

Bond was suspicious of the women as one never knocks its own door at the hotel.