Chapter 6: On Exponentials and Logarithms

Summary: Euler’s first transcendental chapter. He develops the exponential-function informally — extending from integer to fractional to irrational exponents — and then introduces its inverse, the logarithm. Most logarithms are transcendental (§105); they are computed in practice by iterated geometric means (§106), tabulated for primes (§109), and converted between bases by a single multiplicative constant (§107–§108). The chapter closes with the working machinery of common (base-10) logarithms: characteristic-and-mantissa.

Sources: chapter6

Last updated: 2026-04-26


Overview

Up to Chapter 5 every function was algebraic — built from the four arithmetic operations and root extraction (see classification-of-functions). Chapter 6 takes the first step into transcendental territory. Euler concedes that a fully rigorous theory needs integral calculus, but two species of transcendental function — exponentials and their inverse logarithms — can already be developed by elementary means, and they “open the door to further investigations” (source: chapter6, §96).

The chapter has three movements:

  1. §96–§101 — the exponential. Define for variable exponent. Walk through integer, fractional, irrational to make plausible that the function is single-valued and continuous. Case-split on to settle on as the canonical setting.
  2. §102–§109 — the logarithm. Invert: is the exponent that produces . Derive the algebraic rules. Show (§105) that logarithms of “generic” numbers are transcendental. Sketch the computational machinery: compute by iterated geometric means (§106), change base by a single multiplier (§107–§108), and reduce all tabulation to the primes (§109).
  3. §110–§113 — applications and decimal logarithms. Use logarithms to compute complicated expressions and solve ; work out four word problems on population growth and compound interest. Then define common logarithms (base 10) and their split into characteristic and mantissa.

See also: exponential-function, logarithm, transcendence-of-logarithms, geometric-mean-method-for-logarithms, change-of-base, common-logarithm, characteristic-and-mantissa.

Structure of the chapter

§96 — Why exponentials are not algebraic

A power with variable exponent, , , , , — is not an algebraic function, since algebraic functions require the exponents to be constants (source: chapter6, §96). Euler absorbs all the variant forms into a single representative : the analysis of one settles the others.

§97 — Defining on

For positive integer , has the obvious meaning. For , set . For negative integer , . For rational , , which is in general multivalued, but Euler restricts to the primary positive real value so that is single-valued (source: chapter6, §97). This places, e.g., between and . Irrational is handled by interpolation: lies between and . See exponential-function.

§98–§99 — Case analysis on the base

The behavior of depends on (source: chapter6, §98):

  • : constant 1.
  • : strictly increases; as and as .
  • : write to get — the case, reflected.
  • : discontinuity at . For , ; for , ; for , “is infinite” (source: chapter6, §99).
  • : integer exponents alternate sign; rational exponents may produce real or pure-imaginary values ( vs. ); irrational exponents are unpredictable.

§100 distills the conclusion: take ; the case then follows by reflection, and the others are pathological.

§101 — Algebraic rules and the example

With : , , ; if then and (source: chapter6, §101). Worked example for : , , , , etc.

§102 — Logarithm as inverse exponent

For each there is a unique real with ; this is called the logarithm of to the base , written . The base must be specified for the symbol to be unambiguous, and Euler assumes throughout (source: chapter6, §102). See logarithm.

§103 — First values of

regardless of base; , , , etc.; (source: chapter6, §103). Numbers have positive logs; numbers in have negative logs; the “logarithm” of a negative number is complex.

§104 — The algebraic rules of logarithms

From , one gets , , etc. From one gets and (source: chapter6, §104). These four rules — log of a power, log of a root, log of a product, log of a quotient — are the entire algebra of logarithms.

§105 — Logarithms are transcendental

Suppose is rational, say . Then , i.e. ; if both and are rational this forces to be a rational power of . Suppose instead is irrational, say . Then — impossible if are rational (source: chapter6, §105). Conclusion: unless is exactly a power of , is neither rational nor irrational algebraic — Euler labels such quantities transcendental, and so logarithms in general are transcendental. See transcendence-of-logarithms.

§106 — Computing logarithms by geometric means

A transcendental logarithm can be approximated to arbitrary decimal precision by an algorithm using only square roots. The principle: if and , then — the log of the geometric mean is the arithmetic mean of the logs (source: chapter6, §106).

To find : 5 lies between () and (). Set , . Now 5 lies between and ; take , etc. The bounds halve at each step. After ~26 iterations the geometric mean stabilizes to with .

This is how Briggs and Vlacq computed the original tables of common logarithms (source: chapter6, §106 example). See geometric-mean-method-for-logarithms.

§107–§108 — Change of base

Different bases give different logarithm systems, but they are all proportional. If and , then , so , and the ratio is the same for every (source: chapter6, §107). Thus a single multiplier converts one full table into another: e.g. base-10 to base-2 by multiplying every common log by .

§108 strengthens this with a base-free formulation: for any two numbers in the same system, the ratio of their logarithms is base-independent. From in base and in base , both ratios equal — they record the algebraic relationship between and , not the choice of base. See change-of-base.

§109 — Tables built from primes

The product rule reduces tabulation to prime logs: , , etc. Once and are computed, every number whose only prime factors are 2 and 5 (i.e. every terminating decimal multiplied by a power of 10) follows by addition (source: chapter6, §109). Note also that , so a single root extraction (for ) suffices for both.

§110–§111 — Applications

§110 uses logs to evaluate complicated algebraic expressions: e.g. . Numerical roots are found this way without explicit root extraction.

§111 turns to the most important application: solving equations with the unknown in the exponent. From , — the choice of base is irrelevant since the ratio is invariant (§107–§108). Worked examples:

  • Population growth. If a population grows by per year, after 100 years it is multiplied by . Working in common logs, , so the population grows by a factor of (Example II, §110).
  • Bible-flood example. Starting from 6 people after the Flood and reaching 1,000,000 after 200 years requires an annual growth rate of about ; “the same rate over 400 years gives 166 billion — but the earth could not sustain it” (Example III, §110).
  • Doubling per century. Annual rate is then (Example IV, §110).
  • Time to a tenfold population. At rate per year, years (Example I, §111).
  • Compound debt. A loan of 400,000 florins at 5% per annum, repaid 25,000 per year, is settled in just under 33 years — the creditor in fact owes the debtor 318.8 florins after 33 years (Example II, §111).

§112–§113 — Common logarithms: characteristic and mantissa

Base 10 is special because our arithmetic is decimal. A common logarithm splits into:

  • Characteristic: the integer part. Equal to (number of digits in the integer part) . So has characteristic 4; reading the characteristic of any , one knows the number’s digit count (source: chapter6, §112).
  • Mantissa: the decimal fractional part. Encodes the digit string of the number, independent of decimal placement (source: chapter6, §113).

Two numbers whose logs share a mantissa differ only by a power of 10 — same digits, decimal point shifted. Negative characteristics are conventionally shifted upward by 10 (writing 9, 8, 7, … for and noting “diminished by 10”). See characteristic-and-mantissa and common-logarithm.

The closing example: in the progression where each term is the square of the previous, the 25th term is , whose common logarithm is . The characteristic 5050445 says the number has 5,050,446 digits, and the mantissa locates its leading digits — Euler reports the eleven leading digits as .

Notable points

  • First definition of “transcendental” applied to a number, not a function. §105 names logarithms transcendental — extending the algebraic/transcendental distinction from classification-of-functions from expressions to quantities. The argument is a clean dichotomy: either rational (force on ) or impossible.
  • The geometric-mean algorithm (§106) is striking. It computes a transcendental quantity from purely algebraic operations (square roots and bisection of brackets). This anticipates the quadrature-style computations of subsequent chapters and is conceptually parallel to how and will be approached later.
  • Change of base (§107–§108) reduces “infinitely many systems of logarithms” to one. Logarithms are intrinsically a single one-parameter family — the only base-dependent thing is a multiplicative constant. The base-free §108 formulation ( is base-invariant) is the proportionality principle that ties all the systems together.
  • The Bible-flood example (§110, Example III) is unusual. Most of Euler’s worked examples are abstract; this one is socio-theological. He uses it to defend the plausibility of biblical population numbers — a 1/16 annual growth rate is enough to take the post-Flood population from 6 to 1,000,000 in 200 years.
  • §113’s last example is a flex. Computing the digit count of shows logarithms doing work no other tool can do at the time — the number itself is uncomputable in any direct sense.
  • No mention of yet. Euler is careful: the special role of base requires the limit , which belongs to Chapter 7. Here every base is on equal footing.

Why this chapter matters

Chapter 6 introduces the first transcendental functions and the first numerical constants outside the algebraic realm. The algebraic theory of Chapters 1–5 was self-contained but bounded: rational functions, polynomial roots, partial fractions, homogeneous reductions. Now Euler crosses into a class of functions whose values cannot in general be expressed by finite algebraic formulas — and supplies, through §106 and §107–§109, exactly the computational scaffolding (geometric means, change of base, prime tables, characteristic/mantissa) that makes such functions usable in practice.

The chapter is also a setup. Chapter 7 will return to , expand it as a power series via the limit , identify the privileged base for which the series is simplest, and so launch the analytic theory of exponentials and logarithms that the rest of Book I depends on.