Around robin tounament of n contestants is a set of matches where each of the n 2 pairs of contestants play each other exactly once, with the outcome of play being that one contestant wins and one loses. for an integer k < n, let’s consider whether it is possible that the tournament outcome is such that for every set of k player, there is a player that beat each member of that set. show that if n k · 1 − 1 2 kn−k < 1 then such an outcome is possible. you may assume that the probability that any contestant beats another is 50/50

10 points? ? +++ me asap gabriella uses the current exchange rate to write the function, h(x), where x is the number of u.s. dollars and h(x) is the number of euros, the european union currency. she checks the rate and finds that h(100) = 7.5. which statement best describes what h(100) = 75 signifies? a) gabriella averages 7.5 u.s. dollars for every 100 euros. b) gabriella averages 100 u.s. dollars for every 25 euros. c) gabriella can exchange 75 u.s. dollars for 100 euros. d) gabriella can exchange 100 u.s. dollars for 75 euros.