Solution:

Fifteen minutes can easily be measure using these two hour glasses.

Step 1: He will start both the hourglass.

Step 2: The moment the eleven minute hourglass is empty, he will invert it.

Step 3: When the thirteen minutes hourglass is empty, he will invert the eleven minute hourglass.
In step 3, we will have counted thirteen minutes. Since we inverted the eleven minute hourglass in step 2, it started from fresh and was inverted just for two minutes (13-11=2). In this manner when it is reversed when the thirteen minute hourglass is finished, it will have two minutes of sand left. This time when the sand finishes, he will have measured fifteen minutes. (13+2=15)

Solution:

Put one black rock in one sack and put all the rest in the other one. In such manner you will get about 3/4 probability of surviving.

Solution:

The code word is TIE.

Let us assume that the word is MOD. Now if you are told one character of this word, you would not be able to identify the number of vowels in the word. For example if you are told M, then the word can be MOD or AIM but they both have different number of vowels. If you are told about O, then there are two words MOD and OAT which again have different number of vowels. If you are told about D, there are two words again MOD and DUE which have different numbers of vowels again.

In such manner, all the words that have M, O or D in them can be excluded. Then only word that remains is TIE.
If you are told about T, there are two words OAT and TIE which both have two vowels.
If you are told about I, there are two words AIM and TIE which both have two vowels.
If you are told about E, there are two words DUE and TIE which both have two vowels.

Thus TIE is the code word.

Solution:

Let m be initial number of flowers and n be the flowers offered at each temple by the man.
Initial flowers = m
After stepping into the first temple = 2m
Flowers offered at the first temple = n
Remaining flowers = 2m – n

After stepping into the second temple = 4m – 2n
Flowers offered at the second temple = n
Remaining flowers = 2m – n

After stepping into the third temple = 8m – 6n
Flowers offered at the third temple = n
Remaining flowers = 8m – 7n

Now as per the question (8m – 7n) must be equal to 0.
i.e. 8m – 7 n = 0
or 8m = 7y

Now the least numbers required to solve this equation are 7 and 8 for m and n respectively.

Thus m = 7; n = 8
Which means, the man had 7 flowers in the beginning and he offered 8 flowers at each temple.

Solution:

It has been clearly stated that none of the two students gave same number of correct answers which leads us to two different possibilities of correct answers:
Either (1 + 2 +3 + 4 + 5 = 15) or (0 + 1 + 2 + 3 + 4 = 10) stands true.

After analyzing the question, the maximum number of correct answers possible with the answers Gerry, Billy, Clark, Peeta and Jonathan gave:
Question 1 = 2 (b or c)
Question 2 = 2 (b or c)
Question 3= 4 (True)
Question 4 = 4 (True)
Question 5 = 3 (True)

Let us first assume with the maximum number of correct answers possible according to our data which are 15 (2+2+4+4+3). According to it, Billy must have given all correct answers as he was the only one who answered True for questions 3, 4 and 5. But in that case, Gerry and Clark must have given exactly three correct answers. Furthermore, Peeta and Jonathan must have given two correct answers. Therefore none of them got all the five correct answers which is wrong according to what we have analyzed.

Thus we move on to our next assumption according to which, the total number of correct answers are 10 (0+1+2+3+4). Now we must acknowledge that Questions 3 as well as Question 4 cannot be False as it will mean that the number of correct answers would not be 10. So the students giving wrong answers cannot be Gerry, Billy and Peeta.

Assume that Jonathan got all wrong, it will suggest that Gerry, Clark and Peeta each would have at least two correct answers. Then, Billy would have to be the person with only one correct answer and in that situation, the correct answers for questions 1 and 2 would be a and a respectively. Since that is not possible as then the total number of correct answers would be 1 (a) + 1 (a) + 1 (False) + 4 (True) + 2 (Flase) = 9.

Thus it must be Clark who has given all wrong answers. The correct answers are then b, a, True, False and False. Also, the scores are Clark (0), Billy (1), Gerry (2), Jonathan (3) and Peeta (4).

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:

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:

The wise man told them to switch the horses and then race. In this manner, both of them will be willing to race as fast as they can to prove that the other horse (his own horse) is slow.

Solution:

See the colored sticks in the picture. We have moved those sticks in the position given in the second image corresponding with the color.

Solution:

Solution is below