Solution:

43

Explanation:
Here is the thing. You can buy any number of wings that can be divided evenly by three except for three by using the combinations of boxes of 6 and boxes of 9. (You must use at most the box of 9 and then multiple boxes of 6). Now, if there is a number that can't be divided by 3, use a box of 20. After purchasing the box of 20, if the number that remains is divisible by 3, then you are good to go. On the other hand if it is not, you will have to use a second box of 20. And the remaining number will definitely be divisible by 3.

Thus if we calculate the largest number that can't be bought is the one that requires two 20 pieces boxes before the remainder can be thinned down to a number divisible by 3. We know that 3 is the number that can't be purchased and can evenly be divisible, the largest possible number of wings that can't be bought are:
3 + 20 + 20 = 43.

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:

12 steps:

Steps 11 Liter jug 6 Liter Jug
1. 11 -
2. 5 6
3. 5 0
4. 0 5
5. 11 5
6. 10 6
7. 10 0
8. 4 6
9. 4 0
10. 0 4
11. 11 4
12. 9 6 ==> i found 9 liter in 11liter jug(as required)

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:

In the picture you can find the green matchsticks. We have moved them from the bottom and placed them in the middle. It was a bit tricky but now you have your desired result.

Solution:

Upon reaching each room, he found out that the window facing the dead body was closed. He had to open the window himself. This tells that there was somebody else with him who closed the window. If he would have committed suicide, at least one window would have been open.

Solution:

It can be solve as shown below.

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

Solution:

There is a simple logic to solve this question.
The size of the chocolate is 2 x 8. Thus, you need to have 2 x 8 = 16 pieces.
Every time you break the chocolate, you will get one extra piece.
Thus, to get 16 pieces, you must break it (16 - 1) = 15 times.

Solution:

The equation can be solved by substituting
B = 7
A = 8
S = 8
E = 3
L = 5

Therefore the equation now looks as:
7483 +
7455
-------
14938
-------

Solution:

If two widows, each having a son married the son of the other widow, and then by the consummation of marriage, both the couples had a daughter, all the aforementioned relationships will turn to be true.