Solution:

The chocolates in the boxes will be as follows:
Box 1 = 1
Box 2 = 2
Box 3 = 4
Box 4 = 8
Box 5 = 16
Box 6 = 32
Box 7 = 64
Box 8 = 128
Box 9 = 256

Here we have taken a geometric progression to facilitate any number of chocolates demanded. In the last box, we will place the number of chocolates left:

Box 10 = 489

If you try now, you will be able to do what is asked.

Solution:

NONE, holes are empty.

Solution:

One Minute building

building 62 => Sixty second building => One minute building

Solution:

You will ask, I have a number in my mind that i.e. either 2 or 3. Is the number that I have in my mind smaller or equal to the number that you are thinking of?

If Alan replies with no, he is thinking of the number 1.
If Alan replies with yes, he is thinking of the number 3.
If Alan replies with don't know, he is thinking of the number 2.

Solution:

If you ask the guard who always tells the truth, he would tell you the other guard would point you to the door of death. If you ask the guard who always lies, he would tell you the opposite door of the truth-telling guard and point you to the door of death. In either case, both guards will point to the door of death so you should choose the other one.

Solution:

2003.

Explanation:
Its a series of prime numbes.

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:

25 Fruits

Remember we told you that Birbal is a witty trader. So his sole motive is to get rid of the sacks as fast as he can.

For the first sack:
He must be able to fill fruits from one sack to other two sacks. Assume that he is able to do that after M check points. Now to find M,

(Space in first sack) M + (Space in second sack) M = (Remaining fruits in Third Sack) 30 – M
M = 10

Thus after 10 checkpoints, Birbal will be left with only 2 sacks containing 30 fruits each.

Now he must get rid of the second sack.
For that, he must fill the fruits from second sack to the first sack. Assume that he manages to do that after N checkpoints.

(Space in First Sack) N = (Remaining fruits in second sack) 30 – N
N = 15

Thus after he has crossed 25 checkpoints, he will be left be one sack with 30 fruits in it. He has to pass five more checkpoints where he will have to give five fruits and he will be left with twenty five fruits once he has crossed all thirty check points.

Solution:

Zouma is 3 and has two footballs.
Ake is 1 and has one football.
Kalas is 4 and has three footballs.
Aina is 2 and has four footballs.

Solution:

The node can be connected as shown.

Solution:

fIvE thOUsAnd(5000)