Dances between continuous and discrete: Euler's summation formula

12/07/2019
by   David J. Pengelley, et al.
0

Leonhard Euler likely developed his summation formula in 1732, and soon used it to estimate the sum of the reciprocal squares to 14 digits — a value mathematicians had been competing to determine since Leibniz's astonishing discovery that the alternating sum of the reciprocal odd numbers is exactly π /4. This competition came to be known as the Basel Problem, and Euler's approximation probably spurred his spectacular solution in the same year. Subsequently he connected his summation formula to Bernoulli numbers, and applied it to many other topics, masterfully circumventing that it almost always diverges. He applied it to estimate harmonic series partial sums, the gamma constant, and sums of logarithms, thereby calculating large factorials (Stirling's series) with ease. He even commented that his approximation of π was surprisingly accurate for so little work. All this is beautifully presented in mature form in Euler's book Institutiones Calculi Differentialis. I have translated extensive selections for annotated publication as teaching source material in a book Mathematics Masterpieces; Further Chronicles by the Explorers, featuring original sources. I will summarize and illustrate Euler's achievements, including the connection to the search for formulas for sums of numerical powers. I will show in his own words Euler's idea for deriving his summation formula, and how he applied the formula to the sum of reciprocal squares and other situations, e.g., large factorials and binomial coefficients. Finally, I will discuss further mathematical questions, e.g., approximation of factorials, arising from Euler's writings.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2021

A Generalization of Classical Formulas in Numerical Integration and Series Convergence Acceleration

Summation formulas, such as the Euler-Maclaurin expansion or Gregory's q...
research
08/02/2022

Sums of k-bonacci Numbers

We give a combinatorial proof of a formula giving the partial sums of th...
research
10/27/2022

Generalizing the German Tank Problem

The German Tank Problem dates back to World War II when the Allies used ...
research
07/26/2022

A Generalization of Bohr-Mollerup's Theorem for Higher Order Convex Functions: A Tutorial

In its additive version, Bohr-Mollerup's remarkable theorem states that ...
research
09/30/2020

A generalization of Krull-Webster's theory to higher order convex functions: multiple Γ-type functions

We provide uniqueness and existence results for the eventually p-convex ...
research
04/30/2020

Maximum likelihood estimation of the Fisher-Bingham distribution via efficient calculation of its normalizing constant

This paper proposes an efficient numerical integration formula to comput...
research
10/31/2010

Golden and Alternating, fast simple O(lg n) algorithms for Fibonacci

Two very fast and simple O(lg n) algorithms for individual Fibonacci num...

Please sign up or login with your details

Forgot password? Click here to reset