Programming and Computer Software

, Volume 34, Issue 2, pp 95–100

Indefinite summation of rational functions with additional minimization of the summable part


DOI: 10.1134/S0361768808020060

Cite this article as:
Polyakov, S.P. Program Comput Soft (2008) 34: 95. doi:10.1134/S0361768808020060


An algorithm of indefinite summation of rational functions is proposed. For a given function f(x), it constructs a pair of rational functions g(x) and r(x) such that f(x) = g(x + 1) − g(x) + r(x), where the degree of the denominator of r(x) is minimal, and, when this condition is satisfied, the degree of the denominator of g(x) is also minimal.

Copyright information

© Pleiades Publishing, Ltd. 2008

Authors and Affiliations

  1. 1.Computing CenterRussian Academy of SciencesMoscowRussia