Solution:

Solution is below

Solution:

Fifteen Minutes.

After frying for five minutes, you can take out one steak and put the third one inside while turning the other one inside. After five more minutes, one steak is fried from both sides and you can take it out. Now put in the steak that we removed and turn the other one inside. After five more minutes, they both will also be fried from both sides.

Solution:

charles put the ring into the box, secure it with one of your locks, and send the box to the girl firend.
She should then attach one of his own locks and return it. When you receive it again, remove your lock and send it back with her lock. Now she can unlock his own lock and retrieve the object.

Solution:

20
Just count the nines in the numbers: 6, 16, 26, 36, 46, 56, 76, 86, 96, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69.
Note: 66 contains TWO nines

Solution:

A Question

Solution:

Never

Explanation:
In the question, the distance of x miles is given at a particular moment. The middle car is running at that time at 50 MPH. The distance will keep increasing with time as three are running at different speeds. It will increase by x miles every hour till a certain point of time and then it will start decreasing till the fastest car meets the slowest again.

As per question, all the cars stop then. Thus, the distance will never be x miles again.

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:

1 2 3 4 5 6 and 7 8 6

Since summation of numbers 1-9(1 2 3 4 5 6 7 8 9) is 45 , so its impossible to divide into two equal parts.
Since we cant flip over 6 to make it 9 but we can flip 9 to make it 6 and hence the solution

Solution:

None

The sum of numbers from 0-9(0,1,2,3,4,5,6,7,8,9) is 45 and therefore can be divisible by 3 and 9.

Solution:

The probability of two numbers being relatively prime is 60%. Thus if you keep playing the bet, you will hypothetically make 20 cents on every play.

Thus, you should accept the bet.

Solution:

The node can be connected as shown.