Brouncker’s Continued Fraction for
Summary: Applying the §369 reciprocal-series template to the Leibniz series produces William Brouncker’s 1655 continued fraction — the first continued fraction for in the history of mathematics, recovered here by Euler as a particular case of his general series-to-CF dictionary.
Sources: chapter18 (§369 Example II).
Last updated: 2026-05-11
Derivation
The Leibniz series for has the form with . Applying Template II of §369 — set , , , , — gives partial numerators and partial denominators . Therefore
Inverting (Euler’s preferred form, §369 Example II) eliminates the leading :
Numerators are the squares of the odd integers; all partial denominators equal from the second level onward.
Historical note
Euler attributes the identity directly: “this is the expression first found by BROUNCKER as a quadrature of the circle.” William Brouncker (1620–1684), first president of the Royal Society, communicated it to John Wallis around 1655 in connection with Wallis’s Arithmetica infinitorum; it was Wallis who in turn proved it equivalent to his own infinite product . The Brouncker continued fraction was the first ever written down for , predating Euler’s series-CF dictionary by nearly a century.
Convergence
Although the form is elegant, convergence is slow — comparable to the Leibniz series itself. The -th convergent has error of order , not or geometric, because the partial numerators grow at exactly the rate that cancels the geometric decay one would expect from a simple CF with bounded partial numerators. So Brouncker’s formula is more aesthetic than computational; for fast computation of Euler had already given Machin’s formula in chapter 8, and §382 will give the convergents of directly via the Euclidean-algorithm method.
Related pages
- continued-fraction-series-equivalence — the §369 reciprocal-series template Euler applies here
- arctangent-series — source of the Leibniz series
- wallis-product — Wallis’s product, which Brouncker’s CF was derived in connection with
- machin-like-formula — much faster way of computing
- best-rational-approximations — §382 derives a different (faster) CF for by the Euclidean method
- chapter-18-on-continued-fractions