Integer Power Sum for p = 0, 1, 2,

  • Context: Undergrad 
  • Thread starter Thread starter sennyk
  • Start date Start date
  • Tags Tags
    Integer Power Sum
Click For Summary

Discussion Overview

The discussion centers around the integer power sum and the search for a general solution for various values of p (0, 1, 2). Participants explore methods for calculating these sums and the historical context of these methods, including references to existing literature and formulas.

Discussion Character

  • Exploratory, Technical explanation, Debate/contested, Meta-discussion

Main Points Raised

  • One participant proposes a novel method for calculating integer power sums and seeks references to support their approach.
  • Another participant mentions that the method involves Bernoulli numbers and suggests various established techniques, including undetermined coefficients and generating functions.
  • A reference to Faulhaber's formula is provided as a historical context for the discussion.
  • One participant expresses frustration at not finding documentation for their specific method and requests guidance on its origins.
  • Another participant argues that the proposed method is essentially a variation of the method of undetermined coefficients and emphasizes the well-known result that the sum of a polynomial is another polynomial of a higher degree.
  • Participants share links to additional resources, including academic papers and math references, while discussing the perceived triviality of the original method.

Areas of Agreement / Disagreement

Participants do not reach a consensus on the novelty of the proposed method. While some acknowledge the existence of established techniques, others believe the original method may still hold unique aspects worthy of exploration.

Contextual Notes

There are limitations in the discussion regarding the clarity of definitions and the specific assumptions underlying the proposed method. The mathematical steps involved in the various approaches are not fully resolved.

sennyk
Messages
73
Reaction score
0
The other day I was thinking about the integer power sum and the general solution for each value of p. I came up with a method that will allow me to calculate the general solution. I thought that I may have stumbled upon something novel, because I couldn't find any reference to this method anywhere. I was hoping that someone could direct me to some published material that describes this method and sheds some light about the history of this method.

NOTE: I'm a wannabe mathematician that is currently employed as an engineer. Please excuse me if this is too elementary.
 

Attachments

Physics news on Phys.org
I'd appreciate any feedback that I can get. I can't find this method documented anywhere.
 
Trivial
involves Bernoulli numbers
Consult for instance any book on calculus or discrete math.
This can be done many ways
-undetermined coefficients
prove the sum of a polynomial is a polynomial
do specific cases by solving linear equations
-repeated summation
write
x^(n+1)=x^n+...+x^n (x times)
intercge sums
-use generating functions
-use the homogeneous operator
[xD](x^k)=k*x^k
{[xD]^l}(x^k)=(k^l)*x^k
-use the equivelence of summation and antidifferencing
 
I've seen Faulhaber's formula. I've read the mathworld methods at least 3 times. I'm looking for more info my specific method. I've pulled out my calculus and discrete math books, but I've seen nothing that uses my method to find the solution to the power series.

Have you seen the method that I posted? If so, please direct me to some reading about who first used it and maybe how that person arrived upon this method.

Thanks,

Ken
 
Why would there be references or a know inventor? Your method is just a backwards way of doing the method of undetermined coefficients. It is obvious and easily proven (and well known) that the sum of a polynomial is another polynomial of degree one higher. This is the finite calculus equivelant of the infinitesimal calculus result that the integral of a polynomia is another of degree one higher. Solving a linear system is one obvious way to find a particular sum, though neither efficient nor elegant.

some bedtime reading for you
http://arxiv.org/abs/math.CA/9207222
 
Thank you.

Thank you for the link; it is very interesting. More importantly thanks for the site that hosts the link.

I apologize if it was too trivial. It just appeared to me that everyone dismissed the rectangle idea after it doesn't just work for p = 2. I found the system of equations method shown by Shultz on mathworld, but it wasn't the same idea.

What I really thought was that this method was the one that I discovered without a reference, so it must be published somewhere.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 1 ·
Replies
1
Views
3K
  • · Replies 37 ·
2
Replies
37
Views
5K
Replies
8
Views
2K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 2 ·
Replies
2
Views
10K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 5 ·
Replies
5
Views
3K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
3K