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:

10

Explanation:
Equation 1 + 9 + 11 = 1 can be derived from
One (o) + nine (n) + eleven (e) = one => 1

Similarly for equation,
12 + 11 + 9
Twelve (t) + eleven (e) + nine (n) => ten (10)

Solution:

Everyone will done one day or other.

Abraham Lincoln era is too old and we expect most of them(if not all) to be dead by now.

Solution:

20
Just count the nines in the numbers: 6, 16, 26, 36, 46, 56, 76, 86, 96, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69.
Note: 66 contains TWO nines

Solution:

4 6 5 3 (from magician perspective)
3 5 6 4 (viewer perspective)

Detail:

From user perspective:
3 5 6 4 => 5 6 4 3 => 6 5 4 3

For magician perspective
3 4 5 6 (ascending order as)

Solution:

7, 4, 6, 5, 8

Solution:

The two numbers are 4 and 13 whose product is 52 and sum is 17.

Solution:

If you take a look closely, you will acknowledge the fact that every symbol in the given figure is somehow associated with the surrounding one’s position. The upside-down spade is used to the left of a right-side-up heart every time.

Solution:

1/3

Explanation
Assuming T1 is the Toy for brother1, T2 is the toy for brother2 and T3 is the toy for brother3.

Following are the possible cases for toys distribution:

Boy1 Boy2 Boy3
T1 T2 T3
T1 T3 T2
T2 T1 T3
T2 T3 T1 .... (A)
T3 T1 T2 .... (B)
T3 T2 T1

In both steps (A) & (B), no one gets the correct toy.
Therefore probability that none brother can get the own toy is 2/6 = 1/3

Solution:

The competition was held on 11 November 2013. The logic is simple. In America, the dates are mentioned as Month/Day/Year and in Britain, dates are written as Day/Month/Year. But on 11 November 2013, the date and month will be the same. And thus both will write in the same manner i.e. 11/11/2013. If it would have been any other date, the evaluators would have been able to identify it.

Solution:

None

The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.