Horner’s method - XP Math - Forums
Sign Up FREE! | Sign In | Classroom Setup | Common Core Alignment

 XP Math - Forums Horner’s method
 User Name Remember Me? Password
 Register Arcade Members List Mark Forums Read

 Thread Tools Display Modes
 01-13-2007 #1 hyderman Guest   Posts: n/a Horner’s method 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 thanx

 Thread Tools Display Modes Threaded Mode

 Posting Rules You may not post new threads You may not post replies You may not post attachments You may not edit your posts BB code is On Smilies are On [IMG] code is On HTML code is Off Forum Rules
 Forum Jump User Control Panel Private Messages Subscriptions Who's Online Search Forums Forums Home Welcome     XP Math News     Off-Topic Discussion Mathematics     XP Math Games Worksheets     Homework Help     Problems Library     Math Challenges

All times are GMT -4. The time now is 04:05 AM.

 Contact Us - XP Math - Forums - Archive - Privacy Statement - Top

Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, vBulletin Solutions Inc.
XP Math