Solution:

If it's twelve inches long, we call it the foot and not nose.

Solution:

I will be thrown at lions. Now if Akbar threw him at lions, Birbal’s statement will stand true and he will have to bury him alive. But if he bury him, the statement will emerge as false. Thus he had no choice left

Solution:

Numbers of the first cube:
1, 2, 4, 0, 5 and 6.

Numbers on the second cube:
3, 1, 2, 7, 8 and 0.

Now you can pick any date and you will be able to show it using these cubes. Remember that you can always use 6 as 9 by inverting it.

This problem has another solution and we leave it for you to deduce.

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:

Fred Odea won.

Just look at the announcement lines. The first sentence in 'Ok now everybody!' If you take out just the first letter of every word, it will form 'ONE'. In the same manner the second sentence 'The winner of…..' will give form 'TWO' and the third sentence 'The Hardest Riddle Ever Event.' Will form THREE.

Thus the final sentence must form FOUR. There is only one candidate who can suffice with the first two letter and he is Fred Odea. The final sentence of the mastermind must be, 'Fred Odea: Ultimate Riddler!'

Solution:

10

Explanation:
Equation 1 + 9 + 11 = 1 can be derived from
One (o) + nine (n) + eleven (e) = one => 1

Similarly for equation,
12 + 11 + 9
Twelve (t) + eleven (e) + nine (n) => ten (10)

Solution:

At each draw, the number of strawberry candies are either decreasing by 2 or not decreasing at all. In the case of orange candies, at each draw, they are either increasing by 1 or decreasing by 1.

Thus on an assumed outset with at least one candy in the jar to begin with, if the number of strawberry candies are 0 or are even in numbers, they will finish off leaving an orange candy at the end. If otherwise, the remaining candy will be a strawberry one.

Solution:

146900

Explanation:
Whenever you face such type of questions, it is wise to begin from the last thing. Here in this question the last thing will be the 9th temple. He climbed down 100 steps and thus you know, he had Rs. 100 before beginning climbing down. Thus, he must have offered Rs. 100 to the god in that temple too (he offered half of the total amount). Also, he must have dropped Rs. 100 while climbing the steps of the ninth temple. This means that he had Rs. 300 before he begand climbing the steps of the ninth temple.

Now, we will calculate in the similar manner for each of the temples backwards.
Before the devotee climbed the eight temple: (300+100)*2 + 100 = 900
Before the devotee climbed the seventh temple: (900+100)*2 + 100 = 2100
Before the devotee climbed the Sixth temple: (2100+100)*2 + 100 = 4300
Before the devotee climbed the fifth temple: (4300+100)*2 + 100 = 8900
Before the devotee climbed the fourth temple: (8900+100)*2 + 100 = 18100
Before the devotee climbed the third temple: (18100+100)*2 + 100 = 36,500
Before the devotee climbed the second temple: (36500+100)*2 + 100 = 73300
Before the devotee climbed the first temple: (73300+100)*2 + 100 = 146900

Therefore, the devotee had Rs. 146900 with him initially.

Solution:

The check was for dollars 31.63.

The bank teller gave her dollars 63.31
She spent .05, and then she had dollars 63.26, which is twice the check.

Let x be the dollars of the check, and y be the cent.

The check was for 100x + y cent
He was given 100y + x cent

Also
100y + x - 5 = 2(100x + y)
Expanding this out and rearranging, we find:
98y = 199x + 5

or 199x ≡ -5 (mod 98)
or 98*2*x + 3x ≡ -5 (mod 98)
3x ≡ -5 ≡ 93 (mod 98)
this quickly leads to x = 31

Solution:

Playing chess

Game needs two players so Brother-8 is playing chess with Brother-2

Solution:

Jamie is a window cleaner who was tired after cleaning the windows on the 45th floor and thus leaped inside the building.