Testwiki:Reference desk/Archives/Mathematics/2016 November 25
From testwiki
Jump to navigation
Jump to search
Template:Error:not substituted
{| width = "100%"
|- ! colspan="3" align="center" | Mathematics desk |- ! width="20%" align="left" | < November 24 ! width="25%" align="center"|<< Oct | November | Dec >> ! width="20%" align="right" |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. |
November 25
Polynomial coefficients generated by a sum of powers
Is there a general algorithm to generate the coefficients of the expansion of ? For example, . I could use polynomial interpolation on the first terms of the series, but that gets impractical quickly if is large. 24.255.17.182 (talk) 21:47, 25 November 2016 (UTC)
- One interesting thing I noticed is that is invariant with respect to , and starts out , but I don't see an obvious pattern here and this series isn't in OEIS. 24.255.17.182 (talk) 22:13, 25 November 2016 (UTC)
- (ec)Use Binomial_coefficient#Binomial_coefficients_as_a_basis_for_the_space_of_polynomials and the Hockey-stick identity.
- Bo Jacoby (talk) 22:24, 25 November 2016 (UTC).
- Sorry if it's obvious but could you explain how is to be computed? 24.255.17.182 (talk) 23:03, 25 November 2016 (UTC)
- I think what you're looking for is Faulhaber's formula. A generalization is the Euler–Maclaurin formula. --RDBury (talk) 01:43, 26 November 2016 (UTC)
- Sorry if it's obvious but could you explain how is to be computed? 24.255.17.182 (talk) 23:03, 25 November 2016 (UTC)
- The formula is found in the link I gave you.
- Bo Jacoby (talk) 07:18, 26 November 2016 (UTC).