Quantcast XP Math - Forums - View Single Post - Horner’s method
View Single Post
Old 03-18-2007   #7
Posts: n/a

Originally Posted by hyderman View Post
The Horner’s method is an algorithm that evaluates polynomials. The following pseudocode shows how to use this method to find the
value of anxn + an-1xn-1 + . . . + a1x + a0 at x = c.
procedure Horner(c, a0, a1, a2, . . . , an : real numbers)
y := an
for i := 1 to n
y := y × c + an-i
end {y = ancn + an-1cn-1 + . . . + a1c + a0}

(a) Evaluate x2 + 5x + 3 at x = 2 by working through each step of the algorithm.
(b) Exactly how many multiplications and additions are used by this algorithm to evaluate a polynomial of degree n at x = c? (Do not count additions used to increment the loop variable.)
please help me in this ... i am not sure how to solve that

Nothing to be scared about until you are on a bunch of various forums and see hyderman asking same question as a n00b. Seriously, it is precalculus mathematics. It is usually too tedious to use ever in my mind.