Computing log sin and log cos via Infinite Products
Summary: §191–§198: applying the same “take logs, expand, transpose” recipe of §188–§190 to the §184 sine and cosine products yields rapidly convergent series for and . The columns of the transposed double sum are the §169 odd-square sums and the analogous sums over even integers. With these tabulated once, the natural and common logarithms of every trig function at every rational angle become a few additions away. §197–§198 give a faster alternative for via the §181 partial fractions.
Sources: chapter11
Last updated: 2026-05-01
The setup
The §184 products applied to in the original §158 quadratic-factor form (not yet linearized) read
— the §158 forms restricted to rational angles. (One could also start from the linearized §184 forms; Euler uses the quadratic forms here because they keep the bookkeeping symmetric.)
Take the log
For the sine — replacing the awkward leading factor by via the linear factors, then logarithming the rest:
(source: chapter11, §191; the algebra of the lead term is finicky but not deep). Similarly for cosine:
Expand each log via the §118 series
Substituting and summing over produces a double sum in which indexes the power and the original product factor. Transposing — sum first over , holding fixed — the columns become reciprocal-power sums.
The two tables of column sums
Two distinct sets of columns appear, depending on whether the denominator runs over odd integers or all positive integers:
Odd integers (from the cosine product factors at odd denominators , and from the linear-factor cosine):
Even integers (from the sine product factors at even denominators ):
Both sets are §169 sums, differing by the factors vs . Euler tabulates both to 16+ digits (source: chapter11, §193). Note that provides an internal consistency check.
The boxed result for sine
(source: chapter11, §192–§194). The "" subtraction inside each accounts for the term of the all-integer even-power sum being absent (it is folded into the closed-form lead ).
The boxed result for cosine
(source: chapter11, §192–§194). Same recipe: lead term absorbs the slot, and each is the odd-integer reciprocal-power sum minus its first entry.
Convergence
Each and each is dominated by . The -th term of the outer sum is therefore bounded by . Provided — which is always achievable, since trig functions of angles in reduce to those in via the co-function identity — the outer sum converges as . Ten terms give 30+ digits.
Euler is explicit: “the fraction need never be greater than , and for this reason the terms converge much more quickly” (source: chapter11, §196). Convergence is so good that Euler tabulates the coefficients to 18 digits (in §194 for natural logs, §195 for tabular common logs with the convention) and treats the formulas as the practical engine of trig log tables.
Numerical example
For — i.e. — the sine formula gives
which evaluates (via the tabulated ) to , the exact value. Each term is small and the formula re-derives the closed form to twenty digits in a few operations.
Tangent and cotangent — the §197 trick
Naïvely, doubles the work and gives a difference of two close numbers, losing precision. Euler’s better route (§197–§198) starts from the §181 partial-fraction expansion specialized to rational angle:
Each fraction expands as a geometric series in :
Transposing the resulting double sum, the columns are again . Result (source: chapter11, §198):
with the cofactor already known. The cotangent has the analogous formula
(source: chapter11, §198). and then follow by simple addition/subtraction of and using the §137 identities.
Why this matters
These five formulas — , , , , — share one table of constants . Euler computes that table once (chapter11, §190 and §193) and reuses it for every trig log computation thereafter. The combined effect is to make a thirty-digit Tabula Sinuum, Tangentium et Secantium logarithmica feasible to compute by hand.
The same architectural move — “decompose the function into operations on a small precomputed table” — is the ancestor of every method by which special functions are evaluated in modern numerical libraries.
A modern reading
The Euler recipe for is, after rearrangement, the Taylor expansion
This is a special case of the Hurwitz zeta function power series. Euler does not have as a function of complex in the Introductio, but he is computing exactly its values at positive even integers and using them as expansion coefficients. The computational pipeline of this chapter is the same one used in 2026 to evaluate , , and related functions in arbitrary-precision libraries.