Jump to content

Wikipedia:Reference desk/Archives/Mathematics/2021 May 9

From Wikipedia, the free encyclopedia
Mathematics desk
< May 8 << Apr | May | Jun >> Current desk >
Welcome to the Wikipedia Mathematics Reference Desk Archives
The page you are currently viewing is a transcluded archive page. While you can leave answers for any questions shown below, please ask new questions on one of the current reference desk pages.


May 9[edit]

Deriving polynomial coefficients "synthetically"[edit]

Suppose you wanted to find the unknown coefficients the quadratic polynomial p(x) = Ax^2 + Bx + C, which happens to be 5x^2 + 13x^1 + 17. First, observe that the constant term C can be extracted by simply evaluating the polynomial at zero, ie: C = p(0) = 17. Furthermore, the sum of all coefficients is p(1) = 35 and the difference between even and odd terms of the polynomial given by p(-1) = 9. Remove the constant term from both to obtain the sum and difference of A and B, as in K = p(1) - p(0) = 35 - 17 = 5 + 13 = 18 and D = p(-1) - p(0) = 9 - 17 = 5 - 13 = -8, then solve with A = ((K + D)/2) = ((18 + (-8)) / 2) = 5 and B = ((K - D)/2) = ((18 - (-8)) / 2) = 13. Could this be extended to higher polynomials? Earl of Arundel (talk) 18:04, 9 May 2021 (UTC)[reply]

Yes. For any set of pairs in which all values are distinct, there is a unique polynomial of degree at most such that See Polynomial interpolation § Uniqueness of the interpolating polynomial. Taking the coefficients of the polynomial as unknowns, the equations
form a linear system of equations with unknowns. See Polynomial interpolation § Constructing the interpolation polynomial.  --Lambiam 19:03, 9 May 2021 (UTC)[reply]
Awesome, thank you! Earl of Arundel (talk) 21:11, 9 May 2021 (UTC)[reply]
FYI, there's a systematic way to solve this system of linear equations, which is the Lagrange interpolation formula. It can come in handy a lot of times. Duckmather (talk) 20:18, 10 May 2021 (UTC)[reply]
Thank you! Yes, it looks like matrices are the way to go with that. Earl of Arundel (talk) 00:49, 12 May 2021 (UTC)[reply]