=ADD=
=reftype=
14
=number=
03-07
=url=
ftp://ftp.risc.uni-linz.ac.at/pub/techreports/2003/03-07.ps.gz
=year=
2003
=month=
09
=author=
Driver; K. + Prodinger; H. + Schneder; C. + Weideman; A.
=title=
Pad{\' e} Approximations to the Logarithms II: Identities, Recurrences, and Symbolic Computation
=abstract=
Combinatorial identities that were needed in Pad{\' e} approximations to the logarithms 
are proved, mostly with C.~Schneider's computer algebra package Sigma.
The form of the Pad{\' e} approximation of the logarithm
of arbitrary order is stated as a conjecture.
=note=
Submitted
=sponsor=
Supported by the John Knopfmacher Research Centre for Applicable Analysis and Number Theory and the SFB-grant F1305 of the Austrian FWF.
=keywords=
Pad{\' e} approximation, combinatorial identities, computer algebra, creative telescoping