You enter a special kind of chess tournament, in which you play one game with each of three opponents, but you get to choose the order in which you play your opponents, knowing the probability of a win against each. You win the tournament if you win two games in a row, and you want to maximize the probability of winning. Show that it is optimal to play the weakest opponent second, and that the order of playing the other two opponents does not matter.

step-by-step explanation:

57.09 minus 7.0435 equals

step-by-step explanation:

just subtrach them both and u get the answer of 50.0465

step-by-step explanation:

points a and b are equidistant from the desired line, so the line you find by using them will go through point r.

using points other than a and b will give the desired line only if they are equidistant from r. if they are randomly located, the perpendicular line you create will not necessarily go through point r, hence will not be a solution to the problem.

-1   1/6.   you dont subtract the denominators

step-by-step explanation: