Solution:

101/125

Explanation:
This is an extremely tricky question. You have to find the probability where all of them have same number in mind. But if you try to do that, you will have to do a lot of calculations and utilize your brain plenty much. However, the trick to do this question is something opposite. We are not implying that you won’t get answer by directly calculating the probabilities, but it will take much time.

However, if you just go on calculating the negative probabilities, then you can simply subtract it from 1 to find the positive probability. Let us begin the operations and not confuse you further more.

Let us take two friends in the beginning. The probability that Adam and Bella don’t have the same number in their respective mind will be 4/5.

Now let us include Christopher in the scene. The probability that Christopher don’t have a digit same as either Adam or Bella will be 3/5.

Let us now include Drew as well. The probability that she does not have any number in mind which is same as either Adam or Bella or Christopher will be 2/5.

Now the combined probability that none of them has the same number in mind will be:
4/5 * 3/5 * 2/5 = 24/125

Now the probability that they have same number in mind will be:
1 – 24/125 = 101/125

Solution:

16-days

In 15-days, he will climb 15-inch and when he climbs 5 inch more, he will be out of the well :-)

Solution:

LOTTO

Explanation:
Just flip the two rows 1 and 2 vertically, you will find the word "Lotto".

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:

Move the coins as given in the figure and you will get the required result.

Solution:

Step one: First you will have to make 3 trips of 1,000 apples 333 miles. Then you will be left with 2,001 apples and 667 miles to go.

Step two: Next you will have to take 2 trips of 1,000 apples 500 miles. In this manner you will be left with 1,000 apples and 167 miles to go (you have to leave an apple behind).

Step three: At last, you will have to travel the last 167 miles with one load of 1,000 apples and you will be left with 833 apples when you reach the town

Solution:

2003.

Explanation:
Its a series of prime numbes.

Solution:

192

Explanation:
I started with the number 192.
Adding the reversed 291 to 192 gave me 483.
Similarly,
483 + 384 = 867
867 + 768 = 1635
1635 + 5361 = 6996

Solution:

You better switch!

Your first choice has a 1/3 chance of having the car, and that does not change.<br>The other two doors HAD a combined chance of 2/3, but now a Goat has ben revealed behind one, all the 2/3 chance is with the other door.

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:

XIX is the answer which refers to nineteen in roman numeric system. On taking out one i.e. I, we will get XX that is equal to twenty.