Logarithmic Series

Summary: §118–§121 of Chapter 7. Inverting the exponential series derivation, Euler obtains

valid for (where is the base-dependent constant of §114–§116). The naive substitution yields a divergent series for at ; Euler resolves this with the fast-converging variant

obtained by subtracting the series from the series.

Sources: chapter7 (§118–§121)

Last updated: 2026-05-11


Setup (§118)

From §114, for infinitely small , and so in the system with base . Raising to the -th power:

Set , where is a finite number. Then must be infinitely large for — the logarithm of the finite number — to be itself finite (source: chapter7, §118). The picture is the dual of the exponential-series setup: there was the exponent; here is the logarithm.

Derivation (§119)

From , take -th roots:

Since ,

Expand by the binomial series (binomial-series):

Multiply by and use the [[infinitesimal-and-infinite-numbers|-collapse]] , , , etc., for infinite :

The constant on each side cancels, leaving

(source: chapter7, §119). When the base is chosen so (so , see eulers-number), this becomes the canonical natural-log series

— the Mercator series, in modern naming.

Computing : the divergence paradox (§120)

Setting in the boxed series gives, since ,

so

For this reads — the terms grow without bound. Euler flags it explicitly:

2.30258 = , but it is difficult to see how this can be since the terms of this series continually grow larger and the sum of several terms does not seem to approach any limit. We will soon have an answer to this paradox.

(source: chapter7, §120). The boxed series converges only for , and at we have . The “answer” is to substitute differently.

The fast-converging variant (§121)

Substitute for in the boxed series. The signs of odd-power terms flip:

Subtract from the original. Even-power terms cancel; odd-power terms double:

Now solve for :

For any this gives — the series always converges, geometrically. So

For : and

whose terms shrink by a factor of about each pair of steps — fast enough that “soon a satisfactory approximation for can be obtained” (source: chapter7, §121). The paradox of §120 is resolved: Euler swaps to a different algebraic representation of that converges where the first series fails.

Key applications

When (base ), the variant series becomes

Sample values used by Euler in §123 to build a table of :

Computes
, used to extract

Combined with the algebraic identities , , etc. (Chapter 6, §104), these series produce all the integer logs to twenty decimal places.

Two paradoxes worth noting

  1. The §120 series is correct as a formal manipulation but fails as a numerical computation when . Euler does not say “the series diverges”; he says “the sum of several terms does not seem to approach any limit”, and offers a workaround. This is one of the clearest Introductio moments where formal series and numerical convergence part company.
  2. The variant series for has the same domain but parameterizes positive arguments very differently. Setting sweeps across as moves in — every positive number is reachable. So the series alone is enough to compute every logarithm.