Abstract

In response to a letter from Goldbach, Euler considered sums of the form 1 X k=1 ` 1 + 1 2 m + \Delta \Delta \Delta + 1 k m ' (k + 1) \Gamman for positive integers m and n. Euler was able to give explicit values for certain of these sums in terms of the Riemann zeta function. In a recent companion paper, 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 as a rational linear combination of several given constants. The present paper presents the numerical techniques used in these computations and lists many of the experimental results that have been obtained.

Citations