Logarithm
Summary: For base , the logarithm of is the unique real such that , written (§102). Logarithms convert multiplication into addition (§104) and turn the algebra of exponentials inside out. They are real-valued only for positive arguments; for “generic” arguments they are transcendental — see transcendence-of-logarithms.
Sources: chapter6 (§102–§104)
Last updated: 2026-04-26
Definition
Fix a base . For each , the exponential-function takes the value exactly once, so the equation has a unique real solution . This is called the logarithm of to the base , and is denoted
(source: chapter6, §102). The base must be specified for the symbol to be unambiguous; “infinitely many systems of logarithms” exist, one for each base (see change-of-base).
Euler restricts to bases throughout the chapter — the only setting in which is real-valued on and increasing.
When the logarithm is real
- : is a real number.
- : no real satisfies (the equation has as a limit, not a value).
- : no real satisfies when ; “the logarithm is complex” (source: chapter6, §103).
First values (§103)
and
So for and for , in any system. The base itself is identified after the fact as the unique number whose logarithm is 1.
Algebraic rules (§104)
The properties of the exponential-function translate into four rules:
| Exponential identity | Logarithmic identity |
|---|---|
These four are the entire algebra of logarithms (source: chapter6, §104). Their power: a complicated arithmetic expression in becomes a linear combination of the logarithms — the trick that makes logarithm tables a universal calculation tool (cf. §110).
Consequences
- Logarithms of powers and roots of a known number follow from alone.
- Logarithms of products and quotients of known numbers reduce to sums and differences.
- A table of for each prime therefore generates the logarithm of every positive rational by additions, subtractions, and rational multiples (see change-of-base and §109).
Why “transcendental” (§105)
Most logarithms are not rational, not even algebraic — see transcendence-of-logarithms. This forces them to be computed approximately, and motivates the geometric-mean algorithm of §106 and the table-driven calculations of §110–§111.