Suppose a set of 8 numbers are selected from the set {1, 2, …, 13, 14}. show that two of the selected numbers must sum to 15. keyboard_arrow_down solution (b) there are 14 3-digit numbers in a list. can you conclude that there are two distinct subsets of the 14 numbers that have the same sum? justify your answer.

-22

times both sides by 2, times () by 8, add alile terms, move terms, add alike and caculate divide both sides by 3

fjfjfhdhdhdhjjdjdjdjdjjd thats the answers

step-by-step explanation:

asnwer is (g o h o f)(x) = 2x - 6/x + 7

step-by-step explanation:

given,

f(x) = x - 3/x

g(x) = x + 3

h(x) = 2x + 1

we need to find : (g o h o f)(x)

we can write (g o h o f)(x) = g[ h{ f(x) } ]

so first we find h{f(x)}

h{f(x)} = f(x) + 3 = (x - 3/x) + 3

h{f(x)} = x - 3/x + 3

now we find g[ h{ f(x) } ].

g[ h{ f(x) } ] = g(x - 3/x + 3)       {plug h{f(x)} = x - 3/x + 3 in g[h{f(x)}] }

g(x - 3/x + 3) = 2 (x - 3/x + 3) + 1

                    = 2x - 6/x + 6 + 1

                    = 2x - 6/x + 7

hence we get (g o h o f)(x) = 2x - 6/x + 7