Which recursive formula can be used to generate the sequence below, where f(1) = 3 and n 2 1? 3, -6, 12, -24, 48, ...
f(n + 1) = -3 f(n)
f(n + 1) = 3 f(n)
f(n + 1) = -2 f(n)
f(n + 1) = 2 f(n)

pla·gia·rism

/ˈplājəˌrizəm/

learn to pronounce

noun

the practice of taking someone else's work or ideas and passing them off as one's own.

step-by-step explanation:

the correct option is:

b. a value of the variable that makes the polynomial equal to zero.

the root or roots of a polynomial are the values of the variable that makes the polynomial equal to 0. we can find the roots of a polynomial making the expression equal to 0 and then, isolating the variable (it it has just one variable).

for example, given the following polynomial:

the root or zero of the polynomial, can be found by making the expression equal to 0, and then, isolating the variable, so, finding the root we have:

therefore, we have that the root of the polynomial is equal to 2.

we must remember that the number of roots that a polynomial can have, will depend on the degree of the polynomial, a first degree polynomial have will have one single root, a second degree polynomial (quadratic expression) may have two roots and so.

hence the correct option is:

b. a value of the variable that makes the polynomial equal to zero.

have a nice day!