Summation Identity for i^p power question, really simple

Click For Summary
SUMMARY

The discussion centers on the summation identity for the power of integers, specifically the formula for the sum of \(i^p\) from \(i=0\) to \(n\): \(\sum_{i=0}^{n} i^{p} = \frac {(n+1)^{p+1}}{p+1} + \sum_{k=1}^{p} \frac {B_{k}}{p-k+1} \binom{p}{k} (n+1)^{p-k+1}\), where \(B_k\) represents Bernoulli numbers. This formula, known as Faulhaber's formula, is applicable for natural numbers \(p\). Additionally, the discussion highlights the use of \(\binom{p}{k}\) for binomial coefficients, which is a more efficient notation than the alternative provided.

PREREQUISITES
  • Understanding of summation notation and series
  • Familiarity with Bernoulli numbers
  • Knowledge of binomial coefficients and their properties
  • Basic grasp of Faulhaber's formula
NEXT STEPS
  • Study the properties and applications of Bernoulli numbers
  • Explore advanced topics in combinatorial mathematics, focusing on binomial coefficients
  • Investigate the derivation and implications of Faulhaber's formula
  • Learn about the applications of summation identities in mathematical analysis
USEFUL FOR

Mathematicians, students studying combinatorics, and anyone interested in advanced summation techniques and their applications in mathematical theory.

Asphyxiated
Messages
263
Reaction score
0

Homework Statement




\sum_{i=0}^{n} i^{p} = \frac {(n+1)^{p+1}}{p+1} + \sum_{k=1}^{p} \frac {B_{k}}{p-k+1} (^{p}_{k}) (n+1)^{p-k+1}


where Bk is a Bernoulli number.

There is no actual question here I would just like to know if this formula is for sums of i to any power, of course its rather cumbersome but the question still stands. All I want to know is if I understand what it is doing.

edit: oh and

(^{p}_{k}) = \frac {p!}{k!(p-k)!} \;\; 0 \leq k \leq p
 
Last edited:
Physics news on Phys.org
Yes, that is called Faulhaber's formula and is valid for natural numbers p.
 
Incidentally, there is a better way to make binomial coefficients than (^p_k), which will always produce "small" binomial coefficients and won't always place the arguments gracefully with respect to the parentheses. You can write \binom{p}{k} to get \binom{p}{k}.
 

Similar threads

  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
Replies
1
Views
1K
  • · Replies 1 ·
Replies
1
Views
1K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 18 ·
Replies
18
Views
2K
Replies
12
Views
2K
  • · Replies 17 ·
Replies
17
Views
2K
Replies
5
Views
3K