The Arctangent Series

Summary: §139–§141 of Chapter 8. Inverting Euler’s formula gives , which simplifies via to . Substituting in the fast-converging logarithmic series of Chapter 7 yields

At this is Leibniz’s . At it becomes , converging at geometric rate.

Sources: chapter8 (§139, §140, §141)

Last updated: 2026-05-11


§139 — The arc as a complex logarithm

Take §138: and . Their ratio is , so

Euler arrives at this formula not via §138 (which he derives independently a few sections earlier) but via a parallel infinitesimal/infinite calculation: with infinitely small, and , then using from §125 with and in turn (source: chapter8, §139). The cosine equation collapses to a tautology; the sine equation yields the boxed formula above.

The interpretation: every arc is the imaginary part (up to the prefactor) of a complex logarithm. This anticipates the full theory of complex logarithms — the multivaluedness, the branch cuts — but Euler stays within a real-valued reading here.

§140 — Substituting tangent

Divide numerator and denominator inside the logarithm by :

so

But the §123 series gives

so substituting :

Using , , , :

Dividing by :

(source: chapter8, §140). Setting , so :

The series converges for (an observation Euler does not formalize but uses).

§140 — Leibniz’s

At , the arc whose tangent is 1 is , so

(source: chapter8, §140). Euler attributes this discovery to Leibniz. This series gives in closed form as an alternating sum of reciprocal odd integers — beautiful, but practically useless for computation: each correct decimal digit costs about ten new terms.

Chapter 10 re-derives Leibniz’s formula as a special case of a vast family of character-style series obtained by applying Newton’s identities to the §164 arc-form products. Chapter 15 then sieves Leibniz’s series by primes to obtain the Euler-product form — a Dirichlet -function in disguise (see prime-sign-series-for-pi). Chapter 18 converts Leibniz’s series to Brouncker’s continued fraction via the §369 reciprocal-series template.

§141 — A faster series via

For practical computation, choose to get geometric-rate convergence. Try , the tangent of :

i.e.

(source: chapter8, §141). Each term is about a third of the previous, so a dozen terms give roughly six correct digits. Euler comments: “By means of this series the value of itself, which was previously exhibited, was determined with incredible labor” — the prior 113-digit decimal of §126 was computed exactly this way.

§141 first considers , which converges spectacularly fast but does not correspond to any “nice” fraction of the circumference, so cannot be extracted from alone. The §141 lesson: for a useful arctangent identity, must be both small (for convergence) and a known fraction of .

The remaining inconvenience of the §141 series is that every term is irrational ( in the denominator). §142 resolves this by splitting as a sum of arctangents of rational numbers.

Why the series exists at all

The arctangent series is not derivable by elementary trigonometry. It requires the bridge between trig and exponentials (Euler’s formula, §138) plus the logarithmic series of Chapter 7. Without that bridge, the function is defined only implicitly, and there is no algebraic technique in pre-Eulerian mathematics for expanding it as a power series.

After Euler, the series is in some sense trivial: it is just divided by , expanded by the standard logarithm series, with in place of . The whole derivation is two lines once §138–§140 are accepted.

Convergence rate at a glance

ArcSeriesTerms for 6 digits
~
~13
~10
~6

The §142 Machin decomposition uses the last two rows.