volume 35, issue 3, P2-10 2001
DOI: 10.1145/569746.569748
View full text
Sign up to set email alerts

Abstract: 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) = ~,,-~b T (m, k), b 6 Z, 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).