Chapter 1.2.7 – Of the Extraction of Roots applied to Compound Quantities
Summary: Euler develops a systematic algorithm for extracting square roots of compound algebraic expressions and numbers, analogous to long division, and introduces radical notation for non-perfect squares.
Sources: chapter-1.2.7
Last updated: 2026-04-28
The Algorithm
The method exploits the factored form of the remainder when squaring (§317–320): (source: chapter-1.2.7)
Procedure:
- Arrange the square in decreasing powers of one variable.
- The first term of the root is the square root of the leading term.
- Subtract its square, leaving a remainder.
- Divide the remainder by twice the first term found (leaving a blank for the next term); the quotient is the next term of the root.
- Complete the divisor to , confirm the remainder is zero.
- If a remainder persists, treat the two terms found so far as a single new “first part” and repeat.
Euler shows the algorithm in tableau form (§321): (source: chapter-1.2.7)
Two-Term Examples
Worked examples from §322: (source: chapter-1.2.7)
| Square | Root |
|---|---|
Three- and Four-Term Examples
When a remainder is left after the first step, the algorithm continues (§323): (source: chapter-1.2.7)
A notable six-term example: (source: chapter-1.2.7)
Numerical Square Root Extraction
The same algorithm applies to integers, reproducing the standard arithmetic procedure (§324): (source: chapter-1.2.7)
Non-Perfect Squares and Radical Notation
If a remainder persists after all digits are used, the number has no exact square root (§325). Euler uses the radical sign: (source: chapter-1.2.7)
or equivalently the fractional exponent :