Experimental Evaluation of Euler Sums
- 1 January 1994
- journal article
- research article
- Published by Informa UK Limited in Experimental Mathematics
- Vol. 3 (1), 17-30
- https://doi.org/10.1080/10586458.1994.10504573
Abstract
Euler expressed certain sums of the form where m and n are positive integers, in terms of the Riemann zeta function. In [Borwein et al. 1993), Euler's results were extended to a significantly larger class of sums of this type, including sums with alternating signs. This research was facilitated by numerical computations using an algorithm that can determine, with high confidence, whether or not a particular numerical value can be expressed asa rational linear combination of several given constants. The present paper presentsthe numerical techniques used in these computations and lists many of the experimental results that have been obtained.Keywords
This publication has 10 references indexed in Scilit:
- Explicit evaluation of Euler sumsProceedings of the Edinburgh Mathematical Society, 1995
- On some series containing ψ(x)−ψ(y>) and (ψ(x)−ψ(y>))2 for certain values of x and yJournal of Computational and Applied Mathematics, 1991
- Maple V Language Reference ManualPublished by Springer Science and Business Media LLC ,1991
- Polynomial Time Algorithms for Finding Integer Relations among Real NumbersSIAM Journal on Computing, 1989
- Pi, Euler Numbers, and Asymptotic ExpansionsThe American Mathematical Monthly, 1989
- Numerical results on relations between fundamental constants using a new algorithmMathematics of Computation, 1989
- A noninductive GL(n, Z) algorithm that constructs integral linear relations for n Z-linearly dependent real numbersJournal of Algorithms, 1987
- Ramanujan’s NotebooksPublished by Springer Science and Business Media LLC ,1985
- Factoring polynomials with rational coefficientsMathematische Annalen, 1982
- Generalization of the Euclidean algorithm for real numbers to all dimensions higher than twoBulletin of the American Mathematical Society, 1979