Computing the minimal telescoper for sums of hypergeometric terms
H. Q. Le · ACM SIGSAM Bulletin · 2001
Let T ( n, k ) be a hypergeometric term of n and k. We present in this paper an algorithm to construct the minimal telescoper for U ( n, k ) = ∑ m=b n -1 T ( m, k ), b ε ℤ, if it exists. We show a Maple implementation of this method and discuss the problem of finding closed forms of definite sums of U ( n, k ).