An arithmetic sequence is defined by fn = 7 + 8(n – 1). Which of the following is the recursive definition for the sequence?

the solution is x=1

step-by-step explanation:

we are given our   equation as

let's assume

left side function is

right side function is

now, we can draw graph

and then we can get intersection point

the intersection point will be solution

so, the solution is

x=1

55 because 55 + 55 = 110 good luck babe

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

the best estimate is 3 because   8 can only go into 24 3 times