Revision as of 16:37, 7 May 2016 (view source) rosettacode>Arbautjc m (→‎{{header\|Python}}) ← Older edit		Revision as of 16:37, 7 May 2016 (view source) rosettacode>Arbautjc m (→‎{{header\|Python}}) Newer edit →
Line 228: Then summing: <math>\sum_{j=0}^{m} j^n=\sum_{j=0}^m\sum_{k=0}^n S_n^k k!{j\choose k}=\sum_{k=0}^n S_n^k k!{m+1\choose k+1}=\sum_{k=0}^n S_n^k \frac{(m+1)_{k+1}}{k+1}</math>. One has then to ~~develop~~expand the product <math>(m)_{k+1}</math> in order to get a polynomial in the variable <math>m+1</math>. Also, for the sum of <math>j^0</math>, the sum is too large by one (since we start at <math>j=0</math>, this has to be taken into account. <lang python>from fractions import Fraction

Faulhaber's formula: Difference between revisions

Faulhaber's formula (view source)