If F(x) is a solution of this functional equation for a given f(x), then so is F(x)+C(x) for any periodic function C(x) with period 1. Therefore, each indefinite sum actually represents a family of functions. However, due to the Carlson's theorem, the solution equal to its Newton series expansion is unique up to an additive constant C. This unique solution can be represented by formal power series form of the antidifference operator: .
Fundamental theorem of discrete calculusedit
Indefinite sums can be used to calculate definite sums with the formula:[3]
Definitionsedit
Laplace summation formulaedit
where are the Cauchy numbers of the first kind, also known as the Bernoulli Numbers of the Second Kind.[4][citation needed]
Some authors use the phrase "indefinite sum" to describe a sum in which the numerical value of the upper limit is not given:
In this case a closed form expression F(k) for the sum is a solution of
which is called the telescoping equation.[8] It is the inverse of the backward difference operator.
It is related to the forward antidifference operator using the fundamental theorem of discrete calculus described earlier.
List of indefinite sumsedit
This is a list of indefinite sums of various functions. Not every function has an indefinite sum that can be expressed in terms of elementary functions.
^On Computing Closed Forms for Indefinite Summations. Yiu-Kwong Man. J. Symbolic Computation (1993), 16, 355-376[permanent dead link]
^"If Y is a function whose first difference is the function y, then Y is called an indefinite sum of y and denoted Δ−1y" Introduction to Difference Equations, Samuel Goldberg
^"Handbook of discrete and combinatorial mathematics", Kenneth H. Rosen, John G. Michaels, CRC Press, 1999, ISBN 0-8493-0149-1
^Bernoulli numbers of the second kind on Mathworld
^Markus Müller. How to Add a Non-Integer Number of Terms, and How to Produce Unusual Infinite Summations Archived 2011-06-17 at the Wayback Machine (note that he uses a slightly alternative definition of fractional sum in his work, i.e. inverse to backwards difference, hence 1 as the lower limit in his formula)
^Bruce C. Berndt, Ramanujan's Notebooks Archived 2006-10-12 at the Wayback Machine, Ramanujan's Theory of Divergent Series, Chapter 6, Springer-Verlag (ed.), (1939), pp. 133–149.
^Éric Delabaere, Ramanujan's Summation, Algorithms Seminar 2001–2002, F. Chyzak (ed.), INRIA, (2003), pp. 83–88.
^Algorithms for Nonlinear Higher Order Difference Equations, Manuel Kauers
Further readingedit
"Difference Equations: An Introduction with Applications", Walter G. Kelley, Allan C. Peterson, Academic Press, 2001, ISBN 0-12-403330-X
Markus Müller. How to Add a Non-Integer Number of Terms, and How to Produce Unusual Infinite Summations
Markus Mueller, Dierk Schleicher. Fractional Sums and Euler-like Identities
S. P. Polyakov. Indefinite summation of rational functions with additional minimization of the summable part. Programmirovanie, 2008, Vol. 34, No. 2.
"Finite-Difference Equations And Simulations", Francis B. Hildebrand, Prenctice-Hall, 1968