Complete the recursive formula
f(1) =
f(n) = f(n − 1)

solution:

the given function is ,

      =

the three roots of this quadratic function is , 0 ,8 and 10.all the roots are real and rational.

if a quadratic equation is of the form ,

sum of the roots = a + b +c= 0+8+10=18=  

product of roots taken two at a time = a b + b c+ c a = 0+80+0=80 =  

product of roots = a b c = 0=  

there are 11 doors in a hall starting from 0 to 11.the entry in the hall is permitted through gate number 0 and exit is allowed through only gate number 8 and 10.so, three roots(0,8,10) of quadratic function is given by entry and exit route of this hall.

simplifying

5(x + -6) = 2(x + 3)

reorder the terms:

5(-6 + x) = 2(x + 3)

(-6 * 5 + x * 5) = 2(x + 3)

(-30 + 5x) = 2(x + 3)

reorder the terms:

-30 + 5x = 2(3 + x)

-30 + 5x = (3 * 2 + x * 2)

-30 + 5x = (6 + 2x)

solving

-30 + 5x = 6 + 2x

solving for variable 'x'.

move all terms containing x to the left, all other terms to the right.

add '-2x' to each side of the equation.

-30 + 5x + -2x = 6 + 2x + -2x

combine like terms: 5x + -2x = 3x

-30 + 3x = 6 + 2x + -2x

combine like terms: 2x + -2x = 0

-30 + 3x = 6 + 0

-30 + 3x = 6

add '30' to each side of the equation.

-30 + 30 + 3x = 6 + 30

combine like terms: -30 + 30 = 0

0 + 3x = 6 + 30

3x = 6 + 30

combine like terms: 6 + 30 = 36

3x = 36

divide each side by '3'.

x = 12

simplifying

x = 12

this should .

d. all of the above

step-by-step explanation: