Solution:

Simple strategy: Elect one person to be the guesser, the other two pass. The guesser chooses randomly 'green' or 'blue'. This gives them a 50% chance of winning.


Better strategy: If you see two blue or two green hats, then write down the opposite color, otherwise write down 'pass'.

It works like this ('-' means 'pass'):

Hats: GGG, Guess: BBB, Result: Lose
Hats: GGB, Guess: --B, Result: Win
Hats: GBG, Guess: -B-, Result: Win
Hats: GBB, Guess: G--, Result: Win
Hats: BGG, Guess: B--, Result: Win
Hats: BGB, Guess: -G-, Result: Win
Hats: BBG, Guess: --G, Result: Win
Hats: BBB, Guess: GGG, Result: Lose

Result: 75% chance of winning!

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:

All Digits [0-9] follow the following pattern: There is one occurrence of all digits in every 10 numbers Example. Digit-9 occurred one time between 10 and 19 in 9, between 20 and 29 in 29
However, for tens(91,92,93...99) and hundreds (900,901.... 999), the occurrence is much more. Since we have included 1000, Therefor 1 is the most occurred digit.
Note: Despite three '0s' in 1000, 0 is not most occurred digit as they don't have tens and hundreds like other digits.

Solution:

192 021

If you look at it as two-digit numbers you'll see:10 11 12 13 14 15 16 17 18 19 20 21

Solution:

2 people

Say 2 helpers are Helper1 & Helper2

Helper1 food Helper2 food McDuck's Food
End of Day 1 : 1 4 4
Now 'A' will head back

End of Day 2 : N/A 2 4
Now 'B' will head back

Now Mr. McDuck have 4 day food :-)

Solution:

Remove the same 2 matchsticks from each figure and move figure towards left 45 degrees, It forms the letters V W X Y.

Solution:

30,450 miles.

Explanation:
For each 5 miles driven using this rotation, each tire will lose (2/29000)+(2/21000) of its tread.So, suppose we drive 5*N miles like this. Then, each tire will lose 2*N*((1/29000)+(1/21000)) of its tread. We wish to determine N so that the latter expression gets to be 1, representing all of each tire's tread. That happens when N=6090, which is when 5*N (the total miles driven) is 30,450.

Solution:

Tuesday

We know that Christanio Ronaldo tells the truth on only a single day of the week. If the statement on day 1 is untrue, this means that he tells the truth on Monday or Tuesday. If the statement on day 3 is untrue, this means that he tells the truth on Wednesday or Friday. Since Christanio Ronaldo tells the truth on only one day, these statements cannot both be untrue. So, exactly one of these statements must be true, and the statement on day 2 must be untrue.
Assume that the statement on day 1 is true. Then the statement on day 3 must be untrue, from which follows that Christanio Ronaldo tells the truth on Wednesday or Friday. So, day 1 is a Wednesday or a Friday. Therefore, day 2 is a Thursday or a Saturday. However, this would imply that the statement on day 2 is true, which is impossible. From this we can conclude that the statement on day 1 must be untrue.

This means that Christanio Ronaldo told the truth on day 3 and that this day is a Monday or a Tuesday. So day 2 is a Sunday or a Monday. Because the statement on day 2 must be untrue, we can conclude that day 2 is a Monday.

So day 3 is a Tuesday. Therefore, the day on which Christanio Ronaldo tells the truth is Tuesday.

Solution:

10,15,9,20,12

Explanation:
The score obtained on the first throw is 10.
The score obtained on the second throw is 15.
The score obtained on the third throw is 9.
The score obtained on the fourth throw is 20.
The score obtained on the fifth throw is 12.

Solution:

Yes it is possible in Roman Numerals. In Roman Numerals,
9 = IX
10 = X
11 = XI

Thus by removing one from 9, you are getting 10 and by removing one from 11, you are getting 10 again.

Solution:

888 + 88 + 8 + 8 + 8 = 1000