Chapter 9. "Of Cubes, and of the Extraction of Cube Roots."
Part I. Section II. Chapter 9. “Of Cubes, and of the Extraction of Cube Roots.”
333 To find the cube of
We see therefore that it contains the cubes of the two
parts of the root, and, beside that,
334 So that whenever a root is composed of two terms, it is easy to find its cube by this rule: for example, the number 5 = 3 + 2; its cube is therefore 27 + 8 + (18 · 5) = 125.
And if 7 + 3 = 10 be the root; then the cube will be 343 + 27 + (63 · 10) = 1000.
To find the cube of 36, let us suppose the root 36 = 30 + 6, and we have for the cube required, 27000 + 216 + (540 · 36) = 46656.
335 But if, on the other hand, the cube be given, namely,
First, when the cube is arranged according to the powers
of one letter, we easily know by the leading term
336 But as we already know, from Art. 333, that the
second term is
337 But as this second term is supposed to be unknown,
the divisor also is unknown; nevertheless we have
the first term of that divisor, which is sufficient: for it is
338 Let us apply what we have said to two examples of other given cubes.
0 |
339 The analysis which we have given is the foundation of the common rule for the extraction of the cube root in numbers. See the following example of the operation in the number 2197:1 2

Let us also extract the cube root of 34965783:

Editions
- Leonhard Euler. Elements of Algebra. Translated by Rev. John Hewlett. Third Edition. Longmans, Hurst, Rees, Orme, and Co. London. 1822.
- Leonhard Euler. Vollständige Anleitung zur Algebra. Mit den Zusätzen von Joseph Louis Lagrange. Herausgegeben von Heinrich Weber. B. G. Teubner. Leipzig and Berlin. 1911. Leonhardi Euleri Opera omnia. Series prima. Opera mathematica. Volumen primum.
-
AtoZmath.com: Pre-Algebra Calculators. 12.2 Radicals. 8. Cube root of a number using long division method. ↩
-
Paul E. Black, “cube root”, in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 6 May 2019. Available from: https://www.nist.gov/dads/HTML/cubeRoot.html ↩