Suppose that $2n$ tennis players compete in a round-robin tournament. Every player has exactly one match with every other player during $2n-1$ consecutive days. Every match has a winner and a loser. Show that it is possible to select a winning player each day without selecting the same player twice. \\ \\ \textit{Hint: Remember Hall's Theorem}

The gades foundation and hbm corporation are eager to donate generously to their favorite charities. the gades foundation donated $250 in the first month, and each month afterward their cumulative donation total increases by 100$ the hbm corporation donated $64, in the first month, and each month afterward their cumulative donation total increases by 75%. in which month will the hbm corporation's cumulative donation total first exceed the gades foundations' cumulative donation total?

What is the solution to the system of equations? (–2, –8) (–1, –5) (0, –2) (2, 4)

Any is very appreciated! (picture is provided below)not sure how to do this at all won't lie