- n3 = n × n × n.
It is also the number multiplied by its square:
- n3 = n × n2.
This is also the volume formula for a geometric cube with sides of length n, giving rise to the name. The inverse operation of finding a number whose cube is n is called extracting the cube root of n. It determines the side of the cube of a given volume. It is also n raised to the one-third power.
Both cube and cube root are odd functions:
- (−n)3 = −(n3).
- 1 In integers
- 2 In rational numbers
- 3 In real numbers, other fields, and rings
- 4 History
- 5 Notes
- 6 See also
- 7 References
- 8 External links
|13 = 1||113 = 1331||213 = 9261||313 = 29791||413 = 68921||513 = 132651|
|23 = 8||123 = 1728||223 = 10648||323 = 32768||423 = 74088||523 = 140608|
|33 = 27||133 = 2197||233 = 12167||333 = 35937||433 = 79507||533 = 148877|
|43 = 64||143 = 2744||243 = 13824||343 = 39304||443 = 85184||543 = 157464|
|53 = 125||153 = 3375||253 = 15625||353 = 42875||453 = 91125||553 = 166375|
|63 = 216||163 = 4096||263 = 17576||363 = 46656||463 = 97336||563 = 175616|
|73 = 343||173 = 4913||273 = 19683||373 = 50653||473 = 103823||573 = 185193|
|83 = 512||183 = 5832||283 = 21952||383 = 54872||483 = 110592||583 = 195112|
|93 = 729||193 = 6859||293 = 24389||393 = 59319||493 = 117649||593 = 205379|
|103 = 1000||203 = 8000||303 = 27000||403 = 64000||503 = 125000||603 = 216000|
Geometrically speaking, a positive number m is a perfect cube if and only if one can arrange m solid unit cubes into a larger, solid cube. For example, 27 small cubes can be arranged into one larger one with the appearance of a Rubik's Cube, since 3 × 3 × 3 = 27.
The pattern between every perfect cube from negative infinity to positive infinity is as follows,
- n3 = (n − 1)3 + 3(n − 1)n + 1.
- n3 = (n + 1)3 − 3(n + 1)n − 1.
There is no smallest perfect cube, since negative integers are included. For example, (−4) × (−4) × (−4) = −64.
Unlike perfect squares, perfect cubes do not have a small number of possibilities for the last two digits. Except for cubes divisible by 5, where only 25, 75 and 00 can be the last two digits, any pair of digits with the last digit odd can be a perfect cube. With even cubes, there is considerable restriction, for only 00, o2, e4, o6 and e8 can be the last two digits of a perfect cube (where o stands for any odd digit and e for any even digit). Some cube numbers are also square numbers, for example 64 is a square number (8 × 8) and a cube number (4 × 4 × 4); this happens if and only if the number is a perfect sixth power.
It is, however, easy to show that most numbers are not perfect cubes because all perfect cubes must have digital root 1, 8 or 9. Moreover, the digital root of any number's cube can be determined by the remainder the number gives when divided by 3:
- If the number is divisible by 3, its cube has digital root 9;
- If it has a remainder of 1 when divided by 3, its cube has digital root 1;
- If it has a remainder of 2 when divided by 3, its cube has digital root 8.
Waring's problem for cubes
Every positive integer can be written as the sum of nine (or fewer) positive cubes. This upper limit of nine cubes cannot be reduced because, for example, 23 cannot be written as the sum of fewer than nine positive cubes:
- 23 = 23 + 23 + 13 + 13 + 13 + 13 + 13 + 13 + 13.
Fermat's last theorem for cubes
Both of these statements are also true for the equation x3 + y3 = 3z3.
Sum of first n cubes
The sum of the first n cubes is the nth triangle number squared:
For example, the sum of the first 5 cubes is the square of the 5th triangular number,
A similar result can be given for the sum of the first y odd cubes,
but x, y must satisfy the negative Pell equation . For example, for y = 5 and 29, then,
Sum of cubes of numbers in arithmetic progression
There are examples of cubes of numbers in arithmetic progression whose sum is a cube:
with the first one also known as Plato's number. The formula F for finding the sum of n cubes of numbers in arithmetic progression with common difference d and initial cube a3,
is given by
A parametric solution to
is known for the special case of d = 1, or consecutive cubes, but only sporadic solutions are known for integer d > 1, such as d = 2, 3, 5, 7, 11, 13, 37, 39, etc.
Cubes as sums of successive odd integers
In the sequence of odd integers 1, 3, 5, 7, 9, 11, 13, 15, 17, 19, ..., the first one is a cube (1 = 13); the sum of the next two is the next cube (3+5 = 23); the sum of the next three is the next cube (7+9+11 = 33); and so forth.
In rational numbers
In real numbers, other fields, and rings
In real numbers, the cube function preserves the order: larger numbers have larger cubes. In other words, cubes (strictly) monotonically increase. Also, its codomain is the entire real line: the function x ↦ x3 : R → R is a surjection (takes all possible values). Only three numbers equal to the own cubes: −1, 0, and 1. If −1 < x < 0 or 1 < x, then x3 > x. If x < −1 or 0 < x < 1, then x3 < x. All aforementioned properties pertain also to any higher odd power (x5, x7, …) of real numbers. Equalities and inequalities are also true in any ordered ring.
The derivative of x3 equals to 3x2.
Cubes occasionally have the surjective property in other fields, such as in Fp for such prime p that p ≠ 1 (mod 3), but not necessarily: see the counterexample with rationals above. Also in F7 only three elements 0, ±1 are perfect cubes, of seven total. −1, 0, and 1 are perfect cubes anywhere and the only elements of a field equal to the own cubes: x3 − x = x(x − 1)(x + 1).
Determination of the cubes of large numbers was very common in many ancient civilizations. Mesopotamian mathematicians created cuneiform tablets with tables for calculating cubes and cube roots by the Old Babylonian period (20th to 16th centuries BC). Cubic equations were known to the ancient Greek mathematician Diophantus. Hero of Alexandria devised a method for calculating cube roots in the 1st century CE. Methods for solving cubic equations and extracting cube roots appear in The Nine Chapters on the Mathematical Art, a Chinese mathematical text compiled around the 2nd century BCE and commented on by Liu Hui in the 3rd century CE. The Indian mathematician Aryabhata wrote an explanation of cubes in his work Aryabhatiya. In 2010 Alberto Zanoni found a new algorithm to compute the cube of a long integer in a certain range, faster than squaring-and-multiplying.
- Hardy & Wright, Thm. 227
- Hardy & Wright, Thm. 232
- "A Collection of Algebraic Identities".
- Hardy & Wright, Thm. 234
- Hardy & Wright, Thm. 233
- The multiplicative group of Fp is cyclic of order p − 1, and if it is not divisible by 3, then cubes define a group automorphism.
- Cooke, Roger (8 November 2012). The History of Mathematics. John Wiley & Sons. p. 63. ISBN 978-1-118-46029-0.
- Nemet-Nejat, Karen Rhea (1998). Daily Life in Ancient Mesopotamia. Greenwood Publishing Group. p. 306. ISBN 978-0-313-29497-6.
- Van der Waerden, Geometry and Algebra of Ancient Civilizations, chapter 4, Zurich 1983 ISBN 0-387-12159-5
- Smyly, J. Gilbart (1920). "Heron's Formula for Cube Root". Hermathena (Trinity College Dublin) 19 (42): 64–67.
- Crossley, John; W.-C. Lun, Anthony (1999). The Nine Chapters on the Mathematical Art: Companion and Commentary. Oxford University Press. pp. 176, 213. ISBN 978-0-19-853936-0.
- Perfect power
- Euler's sum of powers conjecture
- Taxicab number
- Cabtaxi number
- Doubling the cube
- Kepler's laws of planetary motion#Third law
- Monkey saddle
- Hardy, G. H.; Wright, E. M. (1980). "An Introduction to the Theory of Numbers (Fifth edition)". Oxford: Oxford University Press. ISBN 978-0-19-853171-5.
- A Java applet that decomposes an integer number not congruent to 4 or 5 (mod 9) into a sum of four cubes.