Let (ao, a,, an) be an array representing the coefficients of the polynomial n p(x) =...

Transcribed Image Text:

Let (ao, a,, an) be an array representing the coefficients of the polynomial n p(x) = aox" + a12"-1 + +an-1x+an. We wish to compute p(20), where 20 E R. Horner's algorithm is a method for computing p(10) using n multiplications and n additions. This method is based on rewriting the expression of p(20) as follows p(xo)=(((aoxo + a1)xo + a2)xo ++an-1)x0+ an. Find a recursion relation for this expression. Let (ao, a,, an) be an array representing the coefficients of the polynomial n p(x) = aox" + a12"-1 + +an-1x+an. We wish to compute p(20), where 20 E R. Horner's algorithm is a method for computing p(10) using n multiplications and n additions. This method is based on rewriting the expression of p(20) as follows p(xo)=(((aoxo + a1)xo + a2)xo ++an-1)x0+ an. Find a recursion relation for this expression.