Gosper's algorithm for summation
name, summation variable
expressions, representing upper and lower summation bounds
This function is an implementation of Gosper's algorithm, and calculates a closed form (upward) antidifference of a closed form expression f whenever a closed form (upward) antidifference exists. In this case, the procedure can be used to calculate definite sums
whenever f does not depend on variables occurring in m and n.
An expression f is called closed form with respect to k if
is rational with respect to k. This is typically the case for ratios of products of rational functions, exponentials, factorials, binomial coefficients, and Pochhammer symbols that are integer-linear in their arguments. The implementation supports this type of input.
An expression g is called closed form upward antidifference of f if
If the second argument k is a name, then gosper returns the closed form (upward) antidifference of f with respect to k, or FAIL, if either the input function is no closed form expression, or no closed form antidifference exists. Which of these cases applies, can be seen with infolevelsum≔2 .
If the second argument has the form k=m..n then the definite sum
is determined if Gosper's algorithm applies.
The command with(sumtools,gosper) allows the use of the abbreviated form of this command.
see (SIAM Review, 1994, Problem 94-2)
Download Help Document
What kind of issue would you like to report? (Optional)