Solution:

Man1 is carrying 5 bags and the Man2 is carrying 7 bags.

Let's assume that the Man1 was carrying M1 bags and the Man2 was carrying M2 bags.
M2 + 1 = 2 * (X-1)
M2 + 1 = 2M1 - 2
M2 = 2M1 - 3

Also,
M2 - 1 = M1 + 1
M2 = M1 + 2

=>
2M1 - 3 = M1 + 2
M1 = 5

=>
M2 = 7

Solution:

It will take the man 58 minutes to reach the top.

Since he is climbing 3 feet and falling 2 feet back every passing minute, he is actually climbing 1 feet every minute.
Therefore, he would have climbed 57 feet in 57 minutes. The remaining distance is 3 feet. He will take one more minute to climb it and reach the surface. Since he has reached the top surface, he won't slip back.

Solution:

What must be kept in mind before you start calculating through any method is that the weights can be put on both the pans.

So the weights - 1, 3, 7, 12, 43, 76, 102

The oldest man that can be weighed using these weights is a man aged 122 years

Solution:

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

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:

The password is U472BMT.

Read aloud the line and you will sound something like "U Four Seven 2 B M T".

Solution:

The first step that they will take will be a leap of logic. What it means is that they will deduce that every color must appear twice at least. Why? Because the master logician has assured them that the puzzle will not be impossible for anyone of them. And if a color appears only once in the circle, the person wearing it will have no clue about that color which will not be fair for him.

Then the logicians will follow the same and look for all the colors of hats in the circle. If one of them sees a color just once, he can safely assume that he is also wearing the hat of the same color as by leap of logic, no color can appear just once. Thus when the bell is rung, he will leave.

In the similar fashion, if anyone sees another color just once, he can determine that he is wearing the hat of the same color and will leave when the bell rings or will be disqualified and sent home. Unvaryingly, if a color is seen twice, they will be eliminated after the first bell. Hence, there must be at least three hats of any of the remaining color.

Assume that you are sitting in the circle and you don’t see a color once but see it twice. Then if they were the only two hats of the same color, the logicians must have left at the first bell already. But they did not. Which means that there are three hats of that color and you are wearing one. Thus you will leave after the second bell.

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:

   9567
+ 1085
======
 10652

Solution:

Solution is shown in image below

Solution:

The equation can be solved by substituting
B = 7
A = 8
S = 8
E = 3
L = 5

Therefore the equation now looks as:
7483 +
7455
-------
14938
-------