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

the correct functions are

h(x) = 3x + 2  

g(x) = 2^x

step-by-step explanation:

i proceed to calculate the different values ​​of k (x)

case 1)  k(x) = g(x) ∘ h(x)

g(x) ∘ h(x)=g(h(x))

k(x) = [2]^[3x + > is the option  4. k(x) = 2^(3x + 2 )

case 2)  k(x) = g(x) + h(x)

k(x) = [2^x]+[3x + 2]=2^x+3x+> is the option  1.) k(x) = 2^x + 3x + 2

case 3)k(x) = h(x) ÷ g(x)

k(x) =  [3x + 2]/[2^x]=3x/(2^x)+2/(2^x)=3x*(2^-x)+2^(1-x)

is the option  3.)   k(x) = (3x)2^(-x) + 2^(-x + 1 )

case 4)k(x) = g(x) - h(x)

k(x) =  [2^x]-[3x + 2]=2^x-3x-> is the option  2.) k(x) = 2^x - 3x - 2 

case 5)  k(x) = g(x) × h(x)

k(x) = [2^x]*[3x + > is the option  5.) k(x) = 2^x(3x + 2)

case 6)k(x) = h(x) ∘ g(x)

h(x) ∘ g(x)=h(g(x))

k(x)=3*[2^x]+> is the option  6. k(x) = 3(2^x) +2

circle area = pi * radius^2

if diameter = 10 then radius = 5

circle area = pi * 5^2

circle area = pi * 25

circle area = 78.5398163397 square units

step-by-step explanation:

x =-.20752

step-by-step explanation:

4^(x+2)=12

4^(x+2)=12

take the log base 4 on each side

log 4 (4^(x+2) = log 4(12)

we know log b(a^y) = y log b (a)

(x+2) log 4(4) = log 4 (12)

x+2 = log 4 (12)

we know   logb c = loga c/loga b

we want to convert to base 10   so a = 10

by default, we do not write the 10   c = 4   and b = 10

log4 10 = log 12/log 4

log4 10 = log 12/ log 4

x+2 = log 12/ log 4

subtract 2 from each side

x +2 -2 = log 12/ log 4 -2

x = 1.79248125 -2

x =-.20752