Beyond the Basel problem: Euler’s derivation of the general formula for ζ (2n)

2014 ◽  
Vol 98 (543) ◽  
pp. 459-474 ◽  
Author(s):  
Nick Lord

The problem of finding a closed-form evaluation ofbaffled the pioneers of calculus such as Leibniz and James Bernoulli and, following the latter’s promulgation of the problem, it became known as the Basel problem after his home town (which was also Euler’s birthplace). Euler’s early sensational success in solving the Basel problem by identifyingis extremely well-documented. In this paper, we give the full details of his subsequent derivation of the general formulawhere (Bn) is a sequence of ‘strange constants’. Euler’s polished account of his discovery, in which he popularised the designation of the strange constants as ‘Bernoulli numbers’, appears in Chapter 5 of Volume 2 of his great textbookInstitutiones calculi differentialis[1; E212]: see [2] for an online English translation. Here, we will focus on his initial step-by-step account which appeared in his paper with Eneström number E130, written c1739, carrying the rather nondescript titleDe seriebus quibusdam considerationes, ‘Considerations about certain series’. (For convenience, we will just use ‘Eneström numbers’ when referencing Euler’s work: all are readily available on-line at [1].) Euler’s proof is notable for its early, sophisticated and incisive use of generating functions and for his brilliant insight that the sequence (Bn) occurring in the coefficients of the general ζ(2n) formula (1) also occurs in the Euler-Maclaurin summation formula and in the Maclaurin expansion of. By retracing Euler’s original path, we shall not only be able to admire the master in full creative flow, but also appreciate the role played by recurrence relations such aswhich, as our ample list of references (which will be reviewed later) suggests, have been rediscovered over and over again in the literature. Moreover, our historical approach makes it clear that, while deriving (2) is relatively straightforward (and may be used to calculate ζ(2n) recursively as a rational multiple of ζ2n), it is establishing the connection between ζ(2n) and the Bernoulli numbers that was for Euler the more difficult step. Even today, this step presents pedagogical challenges depending on one’s starting definition for the Bernoulli numbers and what identities satisfied by them one is prepared to assume or derive.

2009 ◽  
Vol 309 (4) ◽  
pp. 887-898 ◽  
Author(s):  
Takashi Agoh ◽  
Karl Dilcher

2021 ◽  
Vol 27 (4) ◽  
pp. 180-186
Author(s):  
André Pierro de Camargo ◽  
◽  
Giulliano Cogui de Oliveira Teruya ◽  

A problem posed by Lehmer in 1938 asks for simple closed formulae for the values of the even Bernoulli polynomials at rational arguments in terms of the Bernoulli numbers. We discuss this problem based on the Fourier expansion of the Bernoulli polynomials. We also give some necessary and sufficient conditions for ζ(2k + 1) be a rational multiple of π2k+1.


The rigorous theory of multiple scattering is developed for monoergic particles incident normally on a plane parallel, homogeneous, amorphous foil. All formulae are given in terms of the single-scattering function, the collision frequency per unit path, and the foil thickness. The underlying random flight problem is formally solved by a set of interlocking recurrence relations. The multiple scattering function is found to depend upon solution of a complicated integral equation, which is discussed in particular for the case of forward scattering. A first forward approximation leads to the general formula of Goudsmith & Saunderson (1940) which, like the equivalent theory of Molière, is therefore valid up to about 10° only. In a second approximation, valid up to about 35°, the basic integral equation must be iterated; the first iterate of the multiple scattering function is obtained explicitly in terms of the simpler first approximation.


Symmetry ◽  
2019 ◽  
Vol 12 (1) ◽  
pp. 9 ◽  
Author(s):  
Daeyeoul Kim ◽  
Yilmaz Simsek ◽  
Ji Suk So

The purpose of this paper is to construct generating functions for negative order Changhee numbers and polynomials. Using these generating functions with their functional equation, we prove computation formulas for combinatorial numbers and polynomials. These formulas include Euler numbers and polynomials of higher order, Stirling numbers, and negative order Changhee numbers and polynomials. We also give some properties of these numbers and polynomials with their generating functions. Moreover, we give relations among Changhee numbers and polynomials of negative order, combinatorial numbers and polynomials and Bernoulli numbers of the second kind. Finally, we give a partial derivative of an equation for generating functions for Changhee numbers and polynomials of negative order. Using these differential equations, we derive recurrence relations, differential and integral formulas for these numbers and polynomials. We also give p-adic integrals representations for negative order Changhee polynomials including Changhee numbers and Deahee numbers.


2001 ◽  
Vol 64 (3) ◽  
pp. 469-474 ◽  
Author(s):  
Ching-Hua Chang ◽  
Chung-Wei Ha

We obtain a class of recurrence relations for the Bernoulli numbers that includes a recurrence formula proved recently by M. Kaneko. Analogous formulas are also derived for the Euler and Genocchi numbers.


2000 ◽  
Vol 61 (2) ◽  
pp. 289-304 ◽  
Author(s):  
Clément Frappier

We present several results related to the recently introduced generalised Bernoulli polynomials. Some recurrence relations are given, which permit us to compute efficiently the polynomials in question. The sums , where jk = jk (α) are the zeros of the Bessel function of the first kind of order α, are evaluated in terms of these polynomials. We also study a generalisation of the series appearing in the Euler-MacLaurin summation formula.


2019 ◽  
pp. 657-666
Author(s):  
Hans-Peter Eckle

Chapter 19 introduces the mathematical techniques required to extract analytic infor- mation from the Bethe ansatz equations for a Heisenberg quantum spin chain of finite length. It discusses how the Bernoulli numbers are needed as a prerequisite for the Euler– Maclaurin summation formula, which allows to transform finite sums into integrals plus, in a systematic way, corrections taking into account the finite size of the system. Applying this mathematical technique to the Bethe ansatz equations results in linear integral equations of the Wiener–Hopf type for the solution of which an elaborate mathematical technique exists, the Wiener–Hopf technique.


2019 ◽  
Vol 15 (10) ◽  
pp. 2043-2055
Author(s):  
Aimin Xu

The generalized Somos recurrence is defined by [Formula: see text] In the present paper, for fixed [Formula: see text], we study the following asymptotic series [Formula: see text] as [Formula: see text]. By using the Bell polynomials and the cycle indicator polynomials of the symmetric group, recurrence relations and a general explicit expression for the coefficients [Formula: see text] are developed. It is also shown that these coefficients are closely related to the Apostol–Bernoulli numbers. Furthermore, an asymptotic estimation for the coefficients [Formula: see text] is given as [Formula: see text].


Sign in / Sign up

Export Citation Format

Share Document