Chapter 1.2.9 – Of Cubes, and of the Extraction of Cube Roots
Summary: Euler derives the binomial cube identity and builds a systematic algorithm for extracting cube roots of compound quantities and numbers, parallel to his square-root algorithm.
Sources: chapter-1.2.9
Last updated: 2026-04-28
The Binomial Cube
Multiplying again by gives (§333): (source: chapter-1.2.9)
The cube contains the cube of each part plus the mixed term , i.e. three times the product of the two parts multiplied by their sum.
Numerical Applications
The identity yields a shortcut for cubing numbers split into two parts (§334): (source: chapter-1.2.9)
Cube Root Extraction Algorithm
Given , find the root (§335–337): (source: chapter-1.2.9)
- First term: the cube root of the leading term is .
- Remainder: subtracting leaves .
- Trial divisor: (three times the square of , already known).
- Quotient : dividing the remainder by the trial divisor gives the next term.
- Complete divisor: (add and once is known).
- Confirm zero remainder; repeat iteratively for more-term roots.
Algebraic Examples
Worked in §338–339: (source: chapter-1.2.9)
Numerical Cube Root Extraction
The same algorithm is the foundation of the standard arithmetic procedure (§339): (source: chapter-1.2.9)