Solution:

80

Explanation:
21 B 7 C 9 D 10 A 13
= 21 / 7 + 9 X 10 - 13
= 3 + 90 - 13
= 80

Solution:

She is near the trunk of the tree as shown below.

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:

Shikhar hit a sixer and then got retired hurt.
Suresh Raina came but he got run out after he and Kohli had crossed halfway.
On the next ball, Kohli scored a six and was not out at 100.

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:

Ganpat had a black suit and a brown suit.
Harish had a brown suit and a pink suit.
Manoj had a white suit and a black suit.
Tarun had a pink suit and a white suit.

Solution:

You can ask this question to any one person, "if I ask the man who is next you: which is the correct way and the road to the village, what would the person next to you answer?"
If you happened to ask this question to the liar, he will show you the wrong way.
And if you happened to ask this question to the one who says truth, he will also show you the wrong way.
Once you are done with this, take the other way. This will lead you to the village

Solution:

Now there can be two solutions to the given situation because there can be two situations:
Suppose if B and C have same colors, A will know that his color is the other one and he will be able to speak up the first.
Now if B and C do not have same colors, A will stay silent. This will tell B that his and C's colors are different. Thus he will speak up first.

So either A or B will speak up first depending on the situation.

Solution:

If two widows, each having a son married the son of the other widow, and then by the consummation of marriage, both the couples had a daughter, all the aforementioned relationships will turn to be true.

Solution:

1/3

Explanation
Assuming T1 is the Toy for brother1, T2 is the toy for brother2 and T3 is the toy for brother3.

Following are the possible cases for toys distribution:

Boy1 Boy2 Boy3
T1 T2 T3
T1 T3 T2
T2 T1 T3
T2 T3 T1 .... (A)
T3 T1 T2 .... (B)
T3 T2 T1

In both steps (A) & (B), no one gets the correct toy.
Therefore probability that none brother can get the own toy is 2/6 = 1/3

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.