Solution:

794

The nth term in the series is given by the sum of x^n for x in the range 1 to 3, i.e. 1^n + 2^n + 3^n.

Thus the first term is 1^1 + 2^1 + 3^1 = 1 + 2 + 3 = 6,
the second term is 1^2 + 2^2 + 3^2 = 1 + 4 + 9 = 14,
and so on.

The sixth term is then 1^6 + 2^6 + 3^6 = 1 + 64 + 729 = 794.

Solution:

99 matches.

The number of matches will always sum up to one less than the number of players in a knock out tournament. You may calculate it in any manner. Thus 99 matches were played.

Solution:

Baseball umpire and the Catcher (Eden Hazard was playing baseball.)

Solution:

A Question

Solution:

This statement is true but only in a specific case i.e. if both of the siblings continue to live till the day the younger is as old as the elder one was during the time of their birth.

Solution:

Colors:
Y B R G
G R B Y
B Y G R
R G Y B


Signs:
x + - /
- / x +
/ - + x
+ x / -

Solution:

There can be two possibilities for the given situation.

One is if I run on the perimeter. Then, the lion will eventually catch me as the lion can follow my radius and then his trajectory will be half of the circle and not a spiral. Therefore, the lion will subsequently catch me in a finite amount of time.

Secondly if I don’t run on the perimeter, then clearly, I have an infinite amount of time before the lion catches me.

Solution:

The ball will take infinite bounces before it is stopped. As per the question it will keep on bouncing half way up every time it hits the ground. But gravity will play its part at certain point of time which will make it stop.

Solution:

Fifteen Minutes.

After frying for five minutes, you can take out one steak and put the third one inside while turning the other one inside. After five more minutes, one steak is fried from both sides and you can take it out. Now put in the steak that we removed and turn the other one inside. After five more minutes, they both will also be fried from both sides.

Solution:

See the figure for the answer. Wasn't it a bit tricky?

Solution:

13 numbers

Explanation:
Since we are looking to find odd reminder which implies that the remainder will be either 1 or 3
Therefore number must follow below two conditions:
A) We can list number 5n + 1 or 5n + 3. (where n = 0,1,2,3.....)
B) The number must end in 1 or 3.

List of such numbers less than 100 are:
1, 3, 11, 13, 21, 23, 31, 33, 41, 43, 51, 53, 61, 63, 71, 73, 81, 83, 91, 93

Let's remove the nonprime ones which are 1, 21, 33, 51, 63, 81 and 91

So, I will be left with 13 numbers which fit the bill.
3, 11, 13, 23, 31, 41, 43, 53, 61, 71, 73, 83 and 93