Solution:

After analyzing the possibilities, it is obvious that my friend has better chances of winning and his average score will be lower at the end.

Let us assume that we have not completed the sequence yet and understand the possibilities. If the last toss of coin was tails, start with step 1 otherwise start at step 2.

Step 1: If either of us toss the coin to get tails, nothing will change. We both will still be at step one and we both will still be needing three more correct tosses of coin to complete our respective sequences. If we get heads, then we continue.

Step 2: If either of us tosses the coin to get heads, we stay on this very step. If we get tails, we continue.

Step 3a (me): If I tosses the coin to get tails, I will have to go back to the step one again and try till I get heads again. Thus I will need at least 3 more tosses to complete my sequence.

Step 3b (my friend): If my friend tosses the coin to get heads, he will go back to step 2 again and will try till he gets tails. In this scenario, he will need at least 2 more tosses to complete the sequence.

Clearly, he has the better opportunity to win this game.

Solution:

Costa

Explanation:
c + 1 characters-> d
o + 2 characters-> q
s + 3 characters-> v
t + 4 characters-> x
a + 5 characters-> f

=> dqvxf = costa

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:

888 + 88 + 8 + 8 + 8 = 1000

Solution:

It can be solved as below.

Solution:

Step 5 is invalid, because we are dividing by (x-y), and since x=y, we are thus dividing by 0. This is an invalid mathematical operation (division by 0), and so by not following basic mathematical rules

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:

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.

Solution:

It can surely be true because it is not mentioned that it was raining.

Solution:

8 liters jar: 8; 5 liters jar: 0; 3 liters jar: 0
Fill 5 liters jar entirely.
8 liters jar: 3; 5 liters jar: 5; 3 liters jar: 0
Fill 3 liters jar with 5 liters jar.
8 liters jar: 3; 5 liters jar: 2; 3 liters jar: 3
Pour entirely from 3 liters jar to 8 liters jar.
8 liters jar: 6; 5 liters jar: 2; 3 liters jar: 0
Pour entirely from 5 liters jar to 3 liters jar.
8 liters jar: 6; 5 liters jar: 0; 3 liters jar: 2
Fill 5 liters jar with water from 8 liters jar.
8 liters jar: 1; 5 liters jar: 5; 3 liters jar: 2
Fill the 3 liters jar with water from the 5 liters jar.
8 liters jar: 1; 5 liters jar: 4; 3 liters jar: 3
Empty 3 liters jar in 8 liters jar.
8 liters jar: 4; 5 liters jar: 4; 3 liters jar: 0

Now you have 4 liters of water in 8 liters jar as well as 5 liters jar.

Solution:

One Night Stand.

Explanation:
Number 'One' + Knight(chess piece) + st + and(symbol &)