Solution:

987,654

Let us assume with a smaller number and then increase the number by extrapolating. If there are two citizens, the number of hairs on their heads will be zero and one. Therefore for ‘n’ number of citizens, the hair distribution will range from 0 to (n-1).

If you take up a case of a number greater than 987,654 let’s say 987,655; and consider the fact that none of the citizens have 987,654 hairs and they must be having different number of hairs, one must be having more than 987,654 hairs which is bluntly violating the fact of the town that there are more citizens than the hairs on any individual.

Solution:

Yes, some people are going get really tiny pieces but you were allowed for that right. Also, there is another way of doing it. Can you think of it?

Solution:

This can be done if you draw a five pointed star and place the balls on the corners and intersection points. See the figure to understand better.

Solution:

C7 => B8
Exchange pawn for a knight

Check-Mate

GameOver

Solution:

16

Explanation:
9 [1x1] squares
5 [2x2] squares
1 [4x4] square
1 [4x4] square

9 + 5 + 1 + 1 = 16 squares.

Solution:

prinka is 10, in a system that awards five for each vowel.

Solution:

To do this, he must be pushing the cork inside the bottle and then taking out the coin.

Solution:

Jeff Killed Mike

1. Jack is not the murderer, because he is the brother of the murderer.
2. Dan can't be the murderer since he ran a marathon, and the murderer recently had his leg amputated, and wouldn't be running a marathon of any magnitude that quickly.
3. Ben is not the murderer if he just met Jack, since Jack and the murderer grew up together.
4. This leaves Jeff and Mike.

Since Jeff is still alive (he wants to install a new computer next week, present tense) he must be the murderer. Mike also didn't grow up with Jack. It has been determined that Jack, Dan and Jeff are all alive. Ben must also be alive since Jeff plans to install Ben's computer next week. This means that Jeff killed Mike.

Solution:

1653

Explanation:
For an ideal case, the batsman will hit a six on each ball. But if he hits six on the last ball of the over, the strike will change in the next over. Thus, the best he can do in the last ball is run 3 runs so that he retains the strike even in the next over. Thus the total runs that he can score in each over:
6 * 5 + 3 = 33
But this will have to go like it only till the 49th over. In the last over, he can hit a six in the last ball as well as that will be the last ball of the match.
Thus runs for the last over will be 6 * 6 = 36.
Hence the maximum runs = 33 * 49 + 36 = 1653

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:

2003.

Explanation:
Its a series of prime numbes.