Does there exist a formula for the sum of n^m numbers?

  • Context: Undergrad 
  • Thread starter Thread starter ~Death~
  • Start date Start date
  • Tags Tags
    Formula Numbers Sum
Click For Summary
SUMMARY

The discussion centers on the existence of a general formula for the sum of the first n^m numbers, where m is an integer. Participants reference established formulas for lower powers, such as the sum of the first n natural numbers, the sum of squares, and the sum of cubes. The conversation highlights Faulhaber's formula as a significant resource for calculating sums of higher powers. This formula provides a systematic approach to derive sums for any integer power m.

PREREQUISITES
  • Understanding of basic algebraic summation
  • Familiarity with Faulhaber's formula
  • Knowledge of polynomial expressions
  • Basic concepts of mathematical induction
NEXT STEPS
  • Study Faulhaber's formula in detail
  • Explore the derivation of sums for higher powers using polynomial techniques
  • Learn about Bernoulli numbers and their role in summation formulas
  • Investigate applications of power sums in combinatorial mathematics
USEFUL FOR

Mathematicians, educators, students in advanced mathematics, and anyone interested in the theory of summation and polynomial functions.

~Death~
Messages
45
Reaction score
0
is there a general formula for the sum of the first

n^m numbers where m is an integer

i know there exists one for the 1+2+...+n and the sum of squares and the sum of cubes

but what about higher powers? And what about a general formula
 
Mathematics news on Phys.org

Similar threads

  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 9 ·
Replies
9
Views
2K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 6 ·
Replies
6
Views
1K
  • · Replies 4 ·
Replies
4
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
2K