Solution:

SHERLOCK

Explanation:
The Number just denotes the position of the letter in the word.
6 Goals Marcos => S
3 Goals Cahil => H
2 Goals Cesar => E
5 Goals Hazard => R
3 Goals Willian => L
8 Goals Jorginho => O
1 Goal Charley => C
4 Goals Barkley => K

Solution:

step 3 is wrong

Solution:

457730 * 4 = 1830920
(DOLLAR * 4 = QUARTER)

Solution:

4

No Of circles in the number.

Solution:

Although it looks complicated, the answer is simple. The password to his computer is JIGSAW.
1st letter of Jug = J
2nd letter of Birthdays = I
3rd letter of Fights = G
4th letter of Cars =S
2nd letter of Laptops = A
1st letter of Watch = W

Solution:

Jeff Killed Mike

1. Jack is not the murderer, because he is the brother of the murderer.
2. Dan can't be the murderer since he ran a marathon, and the murderer recently had his leg amputated, and wouldn't be running a marathon of any magnitude that quickly.
3. Ben is not the murderer if he just met Jack, since Jack and the murderer grew up together.
4. This leaves Jeff and Mike.

Since Jeff is still alive (he wants to install a new computer next week, present tense) he must be the murderer. Mike also didn't grow up with Jack. It has been determined that Jack, Dan and Jeff are all alive. Ben must also be alive since Jeff plans to install Ben's computer next week. This means that Jeff killed Mike.

Solution:

To do it, the marbles must be arranged as the vertices of an octahedron. If you are unsure, check the image below.

Solution:

36 meters.

100/v1 = 80/v2
100/v2 = 80/v3

20+(20/v2)*v3=20+16 = 36

Solution:

2100 miles.

Each vowel equivalent to 500 and each consonant equivalent to -200

Solution:

In the corners of the square, tighten two ropes. Tighten another rope between them by putting rings on each rope. That rope should be tightened on the sheep's neck on the other end.

Solution:

10 prisoners must sample the wine. Bonus points if you worked out a way to ensure than no more than 8 prisoners die.

Number all bottles using binary digits. Assign each prisoner to one of the binary flags. Prisoners must take a sip from each bottle where their binary flag is set.

Here is how you would find one poisoned bottle out of eight total bottles of wine.

Bottle 1 Bottle 2 Bottle 3 Bottle 4 Bottle 5 Bottle 6 Bottle 7 Bottle 8
Prisoner A X X X X
Prisoner B X X X X
Prisoner C X X X X
In the above example, if all prisoners die, bottle 8 is bad. If none die, bottle 1 is bad. If A & B dies, bottle 4 is bad.

With ten people there are 1024 unique combination so you could test up to 1024 bottles of wine.

Each of the ten prisoners will take a small sip from about 500 bottles. Each sip should take no longer than 30 seconds and should be a very small amount. Small sips not only leave more wine for guests. Small sips also avoid death by alcohol poisoning. As long as each prisoner is administered about a milliliter from each bottle, they will only consume the equivalent of about one bottle of wine each.

Each prisoner will have at least a fifty percent chance of living. There is only one binary combination where all prisoners must sip from the wine. If there are ten prisoners then there are ten more combination where all but one prisoner must sip from the wine. By avoiding these two types of combination you can ensure no more than 8 prisoners die.

One viewer felt that this solution was in flagrant contempt of restaurant etiquette. The emperor paid for this wine, so there should be no need to prove to the guests that wine is the same as the label. I am not even sure if ancient wine even came with labels affixed. However, it is true that after leaving the wine open for a day, that this medieval wine will taste more like vinegar than it ever did. C'est la vie.