Solution:

Belgium, Chile, Fiji, Egypt

Solution:

Rhea will open just one present.
Cindy|Y - Y is the 25th alphabet
Duk|E - E is the 5th alphabet
Joh|N - N is the fifteenth alphabet
Rhe|A - A is the first alphabet

Solution:

Align the toothpicks to form TEN. Use one toothpick for each of the lines.

Solution:

They used the planks in the manner that is shown in the figure.

Solution:

Solution is below

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:

He simply suggested that one of the brothers will be allowed to divide the land but he must take into consideration that it will be the other one who will have a choice of selecting his land between the two halves first.

Thus both will be happy in such manner.

Solution:

Solution can be verified from the picture below.

Solution:

The node can be connected as shown.

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:

3/7

Explanation:
If a 31day month starts on a Friday, Saturday or Sunday it will have five Sunday, if not it will have 4 Sunday.