Solution:

2

2^2^(2 * 0)^2
2^2^(0)^2
2^2^0
2^1
2

Solution:

We now have a square of 3x3 size, 2 squares of 2x2 size and 5 squares of 1x1 size.

Solution:

Both 3 and 4th

Explanation:
- The water in tank1 will get filled up to the connectivity of tank1 and the tank2 and then it will start flowing to tank2.
- The water in tank2 will get filled up to the connectivity of tank2 and the -tank3 and then it will start flowing to tank3.
- The water in tank3 will get filled up to the connectivity of tank2 and the tank3 and then it will start flowing to tank3.
- As the outlet of tank3 and inlet of tank4 are not at the same level, water will continue to fill tank3 till the inlet of tank4.
- Now both the tank3 and tank4 fill simultaneously until both fill together.

Solution:

Birbal drew another line that was larger than the pre-drawn line. Now the pre drawn line was smaller.

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:

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.

Solution:

73

Explanation:
It's a very famous puzzle known as "Josephus Problem Puzzle". It can be solved in various ways but the trick to solve this problem is illustrated below.

Binay number of 100 is: 1100100
complement pf 100 is 0011011, whose decimal equivalent is 27.
The desired answer will be 100 - 27 = 73

Solution:

One of the cop will move clockwise while the other will move anti-clockwise every day. In such a manner, they will catch the thief in minimum seven days.

Solution:

2003.

Explanation:
Its a series of prime numbes.

Solution:

== Mathematical Answer ==
Mathematical Answer = number of seconds in a minute * number of minute in an hour * number hour in a day * number of day in year
60 * 60 * 24 * 365 = 31536000
60 * 60 * 24 * 365.25 = 31557600 (if you want account for leap year)


== We are looking for trick answer (which is 24) ==
Every month contains only 2 second like
A) 2nd January ("second" January)
B) 22nd January (twenty"second" January)

Therefore 2 * 12 months = 24.

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.