SumTools[DefiniteSum] - Maple Programming Help

Online Help

All Products    Maple    MapleSim


Home : Support : Online Help : Mathematics : Discrete Mathematics : Summation and Difference Equations : SumTools : DefiniteSum Subpackage : SumTools/DefiniteSum/Definite

SumTools[DefiniteSum]

  

Definite

  

compute closed forms of definite sums

 

Calling Sequence

Parameters

Options

Description

Examples

References

Calling Sequence

Definite(f, k=m..n)

Definite(f, k=m..n, parametric)

Definite(f, k=alpha)

Definite(f, k=expr)

Parameters

f

-

expression; the summand

k

-

name; the summation index

m, n

-

expressions or integers; the summation bounds

parametric

-

(optional) literal name

alpha

-

RootOf expression

expr

-

expression not containing k

Options

• 

If the option parametric is specified, then Definite returns a result that is valid for all possible integer values of any parameters occurring in the summand or the summation bounds. In general, the result is expressed in terms of piecewise functions.

Description

• 

The Definite(f, k=m..n) command computes a closed form of the definite sum of f over the specified range of k.

• 

The function is a combination of different algorithms.  They include

– 

the method of integral representation,

– 

the method of first computing a closed form of the corresponding indefinite sum and then applying the discrete Newton-Leibniz formula,

– 

the method of computing closed forms of definite sums of hypergeometric terms (see SumTools[Hypergeometric]), and

– 

the method of first converting the given definite sum to hypergeometric functions, and then converting these hypergeometric functions to standard functions (if possible).

• 

For more information, see sum.

Examples

withSumToolsDefiniteSum:

F2+kk21+nknkk!nk!

F2+kk21+nknkk!nk!

(1)

SumF,k=0..n=DefiniteF,k=0..n

k=0n2+kk21+nknkk!nk!=3+nn4n!3+nn16n1!

(2)

Fbinomial2n2k,nk24k2k2k+1binomial2k,k1

F2n2knk24k2k2k+12kk

(3)

SumF,k=1..n=DefiniteF,k=1..n

k=1n2n2knk24k2k2k+12kk=2n2n148n2n+1

(4)

Fbinomial2n,2k2

F2n2k2

(5)

SumF,k=0..n=DefiniteF,k=0..n

k=0n2n2k2=−1n2nn2+4n2n2

(6)

F22kπ12ΓknΓk+nΓ2k+1zk

F22kΓn+kΓk+nzkπΓ2k+1

(7)

SumF,k=0..=DefiniteF,k=0..assumingabsz1

k=022kΓn+kΓk+nzkπΓ2k+1=πcos2narcsinzcscπnn

(8)

Parametric case discussions may be returned:

Fbinomial2k3,k4k

F2k3k4k

(9)

SumF,k=0..n=DefiniteF,k=0..n,parametric

k=0n2k3k4k=1+2nn4+2n4n+1n034n=11+2nn4+2n4n+1+382n

(10)

Definite1k,k=a..b

k=ab1k

(11)

Definite1k,k=a..b,parametric

0a=b+1Ψb+1Ψa1aand0bΨbΨ1aa0andb−1FAILotherwise

(12)

Sum over RootOf:

Ft2+1t35t+2

Ft2+1t35t+2

(13)

DefiniteF,t=RootOfx5+x+1

269833

(14)

References

  

Egorychev, G.P. "Integral Representation and the Computation of Combinatorial Sums." Novosibirsk, Nauka. (1977). (in Russian); English: Translations of Mathematical Monographs. Vol. 59. American Mathematical Society. (1984).

  

Roach, K. "Hypergeometric Function Representations." Proceedings ISSAC 1996, pp. 301-308. New York: ACM Press, 1996.

  

van Hoeij, M. "Finite Singularities and Hypergeometric Solutions of Linear Recurrence Equations." Journal of Pure and Applied Algebra. Vol. 139. (1999): 109-131.

  

Zeilberger, D. "The Method of Creative Telescoping." Journal of Symbolic Computing. Vol. 11. (1991): 195-204.

See Also

sum

SumTools[DefiniteSum]

SumTools[DefiniteSum][CreativeTelescoping]

SumTools[DefiniteSum][pFqToStandardFunctions]

SumTools[DefiniteSum][Telescoping]

SumTools[IndefiniteSummation]

SumTools[Summation]