Solution:

small talk

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 answer is very simple. All she had to do is take the fifteen cards from the top and reverse them. This would make another pile out of that and there will be two piles - one of 15 cards and one of 37 cards. Also both of them will have the same number of inverted cards.

Just think about it and if the mathematical explanation will help you understand better, here it is.
Assume that there were p inverted cards initially in the top 15 cards. Then the remaining 37 cards will hold 15-p inverted cards.
Now when she reverses the 15 cards on the top, the number of inverted cards will become 15-p and thus the number of inverted cards in both of the piles will become same.

Solution:

17 mins

The initial solution most people will think of is to use the fastest person as an usher to guide everyone across. How long would that take? 10 + 1 + 7 + 1 + 2 = 21 mins. Is that it? No. That would make this question too simple even as a warm up question.

Let’s brainstorm a little further. To reduce the amount of time, we should find a way for 10 and 7 to go together. If they cross together, then we need one of them to come back to get the others. That would not be ideal. How do we get around that? Maybe we can have 1 waiting on the other side to bring the torch back. Ahaa, we are getting closer. The fastest way to get 1 across and be back is to use 2 to usher 1 across. So let’s put all this together.

1 and 2 go cross
2 comes back
7 and 10 go across
1 comes back
1 and 2 go across (done)

Total time = 2 + 2 + 10 + 1 + 2 = 17 mins

Solution:

The Stars

Solution:

One Night Stand.

Explanation:
Number 'One' + Knight(chess piece) + st + and(symbol &)

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:

It can be done in 8 moves as shown in the animated image below.

Solution:

A typical way will be to start thinking about summing up the distance that the bee will travel but that will be quite a tedious task. How about we offer you a much easy solution?

The tunnel is 200 miles long and the trains are running at as peed of 100 mph which means that they will collide exactly at the center of the tunnel and seeking their speed, they will collide after an hour.

Now consider the bee which is flying at a speed of 1000 mph and will keep flying till the train collides. As calculated, it will keep flying for an hour which means the distance that it will cover is 1000 miles.

Solution:

28 =>1+2+4+7+14

cannot be 1 (as number cannot be included)

Solution:

The matchsticks that are marked with red are to be removed and the final figure will have just two squares. You can remove either pair from the possible four ways.