compute closed forms of definite sums

はじめる前に
新機能一覧
Maple ワークシートの作成
Mapleワークシートを共有
Maple ウィンドウのカスタマイズ
Maple システムのカスタマイズ
コネクティビティ
Mathematics
数学
- テンソル解析
- パッケージ
- ファンクションアドバイザ
- ベキ級数
- ベクトル解析
- 不活性関数
- 代数
- 因数分解と方程式解法
- 基本数学
- 基本的な注意事項
- 変分法
- 変換
- 幾何
- 微分代数方程式
- 微分幾何学
- 微分方程式
- 微積分
- 数
- 数値計算
- 数学関数
- 数論
- 最適化
- 特殊関数
- 統計
- 線形代数
- 群論
- 評価
- 論理
- 過去のパッケージ
- 金融
- 離散数学
  - グラフ理論
  - 組合せ論
  - 総和と差分方程式
  - 離散変換
  - OrderBasis コマンド
  - 積
- piecewise examples
- グラフ電卓
- 区分関数
物理
プログラミング
グラフィックス
Student パッケージ
Science and Engineering
科学・エンジニアリング
アプリケーションと例題
リファレンス
システム
MapleSim
MapleSim ツールボックス
MapleSim ヘルプ
Tasks
Toolboxes
エラーメッセージガイド
マニュアル
数学アプリ

SumTools[DefiniteSum][Definite] - compute closed forms of definite sums

	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

Description

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

•	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.

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.

Examples

(1)

Sum(F, k = 0 .. n) = Definite(F, k = 0 .. n)

Sum((2+k)^(k-2)*(1+n-k)^(n-k)/(factorial(k)*factorial(n-k)), k = 0 .. n) = (1/4)*(3+n)^n/factorial(n)-(1/6)*(3+n)^(n-1)/factorial(n-1)

(2)

(3)

Sum(F, k = 1 .. n) = Definite(F, k = 1 .. n)

Sum((1/2)*binomial(2*n-2*k, n-k)*2^(4*k)/(k*(2*k+1)*binomial(2*k, k)), k = 1 .. n) = -4*(1-2*n)*binomial(2*n-2, n-1)/(2*n+1)

(4)

(5)

Sum(F, k = 0 .. n) = Definite(F, k = 0 .. n)

Sum(binomial(2*n, 2*k)^2, k = 0 .. n) = ((1/2)*(-1)^n*GAMMA(1/2+n)^2/Pi^(1/2)+(1/2)*GAMMA(1/2+2*n))*4^n/(GAMMA(1/2+n)*GAMMA(n+1))

(6)

F := 2^(2*k)*GAMMA(k-n)*GAMMA(k+n)*z^k/(Pi^(1/2)*GAMMA(2*k+1))

F := 2^(2*k)*GAMMA(-n+k)*GAMMA(k+n)*z^k/(Pi^(1/2)*GAMMA(2*k+1))

(7)

Sum(F, k = 0 .. infinity) = Definite(F, k = 0 .. infinity)

Sum(2^(2*k)*GAMMA(-n+k)*GAMMA(k+n)*z^k/(Pi^(1/2)*GAMMA(2*k+1)), k = 0 .. infinity) = -Pi^(1/2)*cos(2*n*arcsin(z^(1/2)))*csc(Pi*n)/n

(8)

Parametric case discussions may be returned:

(9)

Sum(F, k = 0 .. n) = Definite(F, k = 0 .. n, parametric)

Sum(binomial(2*k-3, k)/4^k, k = 0 .. n) = PIECEWISE([0, n = -1], [2*(n+1)*(2+n)*binomial(2*n-1, n+1)/((n-1)*4^(n+1)), n <= 0], [3/4, n = 1], [2*(n+1)*(2+n)*binomial(2*n-1, n+1)/((n-1)*4^(n+1))+3/8, 2 <= n])

(10)

Warning, unable to determine if the summand is singular in the interval of summation; try to use assumptions or use the parametric option

sum(1/k, k = a .. b)

(11)

PIECEWISE([0, a = b+1], [Psi(b+1)-Psi(a), 1 <= a and 0 <= b], [Psi(-b)-Psi(1-a), a <= 0 and b <= -1], [FAIL, otherwise])

(12)

Sum over RootOf:

F := (t^2+1)/(t^3-5*t+2)

(13)

(14)

	See Also
	sum, SumTools[DefiniteSum], SumTools[DefiniteSum][CreativeTelescoping], SumTools[DefiniteSum][pFqToStandardFunctions], SumTools[DefiniteSum][Telescoping], SumTools[IndefiniteSummation], SumTools[Summation]

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.