VOOZH about

URL: https://mathworld.wolfram.com/CubicNumber.html

⇱ Cubic Number -- from Wolfram MathWorld


πŸ‘ Image

Cubic Number


πŸ‘ DOWNLOAD Mathematica Notebook
Download Wolfram Notebook

A cubic number is a figurate number of the form πŸ‘ n^3
with πŸ‘ n
a positive integer. The first few are 1, 8, 27, 64, 125, 216, 343, ... (OEIS A000578). The protagonist Christopher in the novel The Curious Incident of the Dog in the Night-Time recites the cubic numbers to calm himself and prevent himself from wanting to hit someone (Haddon 2003, p. 213).

The generating function giving the cubic numbers is

The hex pyramidal numbers are equivalent to the cubic numbers (Conway and Guy 1996).

The plots above show the first 255 (top figure) and 511 (bottom figure) cubic numbers represented in binary.

Pollock (1843-1850) conjectured that every number is the sum of at most 9 cubic numbers (Dickson 2005, p. 23). As a part of the study of Waring's problem, it is known that every positive integer is a sum of no more than 9 positive cubes (πŸ‘ g(3)=9
, proved by Dickson, Pillai, and Niven in the early twentieth century), that every "sufficiently large" integer is a sum of no more than 7 positive cubes (πŸ‘ G(3)<=7
). However, it is not known if 7 can be reduced (Wells 1986, p. 70). The number of positive cubes needed to represent the numbers 1, 2, 3, ... are 1, 2, 3, 4, 5, 6, 7, 1, 2, 3, 4, 5, 6, 7, 8, 2, ...(OEIS A002376), and the number of distinct ways to represent the numbers 1, 2, 3, ... in terms of positive cubes are 1, 1, 1, 1, 1, 1, 1, 2, 2, 2, 2, 2, 2, 2, 2, 3, 3, 3, 3, 3, 3, 3, 3, 4, 4, 4, 5, 5, 5, 5, ... (OEIS A003108).

In 1939, Dickson proved that the only integers requiring nine positive cubes are 23 and 239. Wieferich proved that only 15 integers require eight cubes: 15, 22, 50, 114, 167, 175, 186, 212, 231, 238, 303, 364, 420, 428, and 454 (OEIS A018889). The quantity πŸ‘ G(3)
in Waring's problem therefore satisfies πŸ‘ G(3)<=7
, and the largest number known requiring seven cubes is 8042. Deshouillers et al. (2000) conjectured that 7373170279850 is the largest integer that cannot be expressed as the sum of four nonnegative cubes.

The following table gives the first few numbers which require at least πŸ‘ N=1
, 2, 3, ..., 9 (i.e., πŸ‘ N
or more) positive cubes to represent them as a sum.

πŸ‘ N
OEISnumbers
1A0005781, 8, 27, 64, 125, 216, 343, 512, ...
2A0033252, 9, 16, 28, 35, 54, 65, 72, 91, ...
3A0477023, 10, 17, 24, 29, 36, 43, 55, 62, ...
4A0477034, 11, 18, 25, 30, 32, 37, 44, 51, ...
5A0477045, 12, 19, 26, 31, 33, 38, 40, 45, ...
6A0460406, 13, 20, 34, 39, 41, 46, 48, 53, ...
7A0188907, 14, 21, 42, 47, 49, 61, 77, ...
8A01888915, 22, 50, 114, 167, 175, 186, ...
9A01888823, 239

There is a finite set of numbers which cannot be expressed as the sum of distinct positive cubes: 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, ...(OEIS A001476).

It is known that every integer is a sum of at most 5 signed cubes (πŸ‘ eg(3)<=5
in Waring's problem). It is believed that 5 can be reduced to 4, so that

for any number πŸ‘ N
, although this has not been proved for numbers of the form πŸ‘ 9n+/-4
. However, every multiple of 6 can be represented as a sum of four signed cubes as a result of the algebraic identity

In fact, all numbers πŸ‘ N<1000
and not of the form πŸ‘ 9n+/-4
are known to be expressible as the sum

of three (positive or negative) cubes with the exception of πŸ‘ N=42
, 114, 165, 390, 579, 627, 633, 732, 795, 906, 921, and 975 (Miller and Woollett 1955; Gardiner et al. 1964; Guy 1994, p. 151; Mishima; Elsenhaus and Jahnel 2007; Booker; Huisman 2016). Examples include:

πŸ‘ 30
πŸ‘ =
πŸ‘ (-283059965)^3+(-2218888517)^3+2220422932^3
(5)
πŸ‘ 33
πŸ‘ =
πŸ‘ 8866128975287528^3+(-8778405442862239)^3+(-2736111468807040)^3
(6)
πŸ‘ 52
πŸ‘ =
πŸ‘ 60702901317^3+23961292454^3+(-61922712865)^3
(7)
πŸ‘ 74
πŸ‘ =
πŸ‘ (-284650292555885)^3+66229832190556^3+283450105697727^3
(8)
πŸ‘ 75
πŸ‘ =
πŸ‘ 435203083^3+(-435203231)^3+4381159^3
(9)
πŸ‘ 84
πŸ‘ =
πŸ‘ 41639611^3+(-41531726)^3+(-8241191)^3
(10)
πŸ‘ 110
πŸ‘ =
πŸ‘ 109938919^3+16540290030^3+(-16540291649)^3
(11)
πŸ‘ 195
πŸ‘ =
πŸ‘ (-2238006277)^3+(-5087472163)^3+5227922915^3
(12)
πŸ‘ 290
πŸ‘ =
πŸ‘ 426417007^3+2070897315^3+(-2076906362)^3
(13)
πŸ‘ 435
πŸ‘ =
πŸ‘ 4460467^3+(-4078175)^3+(-2755337)^3
(14)
πŸ‘ 444
πŸ‘ =
πŸ‘ 3460795^3+14820289^3+(-14882930)^3
(15)
πŸ‘ 452
πŸ‘ =
πŸ‘ (-2267462975)^3+(-3041790413)^3+3414300774^3
(16)
πŸ‘ 462
πŸ‘ =
πŸ‘ 1933609^3+(-1832411)^3+(-1024946)^3
(17)
πŸ‘ 478
πŸ‘ =
πŸ‘ (-1368722)^3+(-13434503)^3+13439237^3.
(18)

While it is known that equation (β—‡) has no solutions for πŸ‘ N
of the form πŸ‘ 9n+/-4
(Hardy and Wright 1979, p. 327), there are known reasons for excluding the above integers (Gardiner et al. 1964). Mahler proved that 1 has infinitely many representations as three signed cubes.

If one also excludes numbers of the form πŸ‘ 108n+/-38
, every number can be represented as a sum of four signed cubes, using one of the following algebraic identities, or their complementary identities (via πŸ‘ x->-x
):

These identities,and a proof for πŸ‘ 108n+/-38
were given by Demjanenko (Demjanenko 1966, Cohen 2004).

The following table gives the numbers which can be represented in exactly πŸ‘ W
different ways as a sum of πŸ‘ N
positive cubes. (Combining all πŸ‘ W
s for a given πŸ‘ N
then gives the sequences in the previous table.) For example,

can be represented in πŸ‘ W=2
ways by πŸ‘ N=5
cubes. The smallest number representable in πŸ‘ W=2
ways as a sum of πŸ‘ N=2
cubes,

is called the Hardy-Ramanujan number and has special significance in the history of mathematics as a result of a story told by Hardy about Ramanujan. Note that OEIS A001235 is defined as the sequence of numbers which are the sum of cubes in two or more ways, and so appears identical in the first few terms to the πŸ‘ (N=2,W=2)
series given below.

πŸ‘ N
πŸ‘ W
OEISnumbers
10A0074122, 3, 4, 5, 6, 7, 9, 10, 11, 12, 13, 14, ...
11A0005781, 8, 27, 64, 125, 216, 343, 512, ...
20A0579031, 3, 4, 5, 6, 7, 8, 10, 11, 12, 13, 14, ...
212, 9, 16, 28, 35, 54, 65, 72, 91, ...
22A0188501729, 4104, 13832, 20683, 32832, ...
23A00382587539319, 119824488, 143604279, ...
24A0038266963472309248, 12625136269928, ...
2548988659276962496, ...
268230545258248091551205888, ...
30A0579041, 2, 4, 5, 6, 7, 8, 9, 11, 12, 13, 14, ...
31A0253953, 10, 17, 24, 29, 36, 43, 55, 62, ...
32251, ...
40A0579051, 2, 3, 5, 6, 7, 8, 9, 10, 12, 13, 14, ...
41A0254034, 11, 18, 25, 30, 32, 37, 44, 51, ...
42A025404219, 252, 259, 278, 315, 376, 467, ...
50A0579061, 2, 3, 4, 6, 7, 8, 9, 10, 11, 13, 14, 15, ...
51A0489265, 12, 19, 26, 31, 33, 38, 40, 45, ...
52A048927157, 220, 227, 246, 253, 260, 267, ...
60A0579071, 2, 3, 4, 5, 7, 8, 9, 10, 11, 12, 14, 15, ...
61A0489296, 13, 20, 27, 32, 34, 39, 41, 46, ...
62A048930158, 165, 184, 221, 228, 235, 247, ...
63A048931221, 254, 369, 411, 443, 469, 495, ...

The following table gives the possible residues (mod πŸ‘ n
) for cubic numbers for πŸ‘ n=1
to 20, as well as the number of distinct residues πŸ‘ s(n)
.

πŸ‘ n
πŸ‘ s(n)
πŸ‘ x^3 (mod n)
220, 1
330, 1, 2
430, 1, 3
550, 1, 2, 3, 4
660, 1, 2, 3, 4, 5
730, 1, 6
850, 1, 3, 5, 7
930, 1, 8
10100, 1, 2, 3, 4, 5, 6, 7, 8, 9
11110, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10
1290, 1, 3, 4, 5, 7, 8, 9, 11
1350, 1, 5, 8, 12
1460, 1, 6, 7, 8, 13
15150, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14
16100, 1, 3, 5, 7, 8, 9, 11, 13, 15
17170, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16
1860, 1, 8, 9, 10, 17
1970, 1, 7, 8, 11, 12, 18
20150, 1, 3, 4, 5, 7, 8, 9, 11, 12, 13, 15, 16, 17, 19

Dudeney found two rational numbers other than 1 and 2 whose cubes sum to nine,

(Gardner 1958). The problem of finding two rational numbers whose cubes sum to six was "proved" impossible by Legendre. However, Dudeney found the simple solutions 17/21 and 37/21.

The only three consecutive integers whose cubes sum to a cube are given by the Diophantine equation

Catalan's conjecture states that 8 and 9 (πŸ‘ 2^3
and πŸ‘ 3^2
) are the only consecutive powers (excluding 0 and 1), i.e., the only solution to Catalan's Diophantine problem. This conjecture has not yet been proved or refuted, although R. Tijdeman has proved that there can be only a finite number of exceptions should the conjecture not hold. It is also known that 8 and 9 are the only consecutive cubic and square numbers (in either order).

There are six positive integers equal to the sum of the digits of their cubes: 1, 8, 17, 18, 26, and 27 (OEIS A046459; Moret Blanc 1879). There are four positive integers equal to the sums of the cubes of their digits:

(Ball and Coxeter 1987). There are two square numbers of the form πŸ‘ n^3-4
: πŸ‘ 4=2^3-4
and πŸ‘ 121=5^3-4
(Le Lionnais 1983). A cube cannot be the concatenation of two cubes, since if πŸ‘ c^3
is the concatenation of πŸ‘ a^3
and πŸ‘ b^3
, then πŸ‘ c^3=10^ka^3+b^3
, where πŸ‘ k
is the number of digits in πŸ‘ b^3
. After shifting any powers of 1000 in πŸ‘ 10^k
into πŸ‘ a^3
, the original problem is equivalent to finding a solution to one of the Diophantine equations

None of these have solutions in integers, as proved independently by Sylvester, Lucas, and Pepin (Dickson 2005, pp. 572-578).


See also

Biquadratic Number, Centered Cube Number, Clark's Triangle, Cuban Prime, Cubic Triangular Number, Diophantine Equation--3rd Powers, Hardy-Ramanujan Number, Partition, Square Number

Explore with Wolfram|Alpha

References

Ball, W. W. R. and Coxeter, H. S. M. Mathematical Recreations and Essays, 13th ed. New York: Dover, p. 14, 1987.Bertault, F.; RamarΓ©, O.; and Zimmermann, P. "On Sums of Seven Cubes." Math. Comput. 68, 1303-1310, 1999.Booker, A. R. "Cracking the Problem with 33." n.d. https://people.maths.bris.ac.uk/~maarb/papers/cubesv1.pdf.Cohen, H."On Sums of Four Cubes." (Trans. of Demjanenko's paper.) 2004. http://www.math.u-bordeaux.fr/~cohen/.Conn, B. and Vaserstein, L. "On Sums of Three Integral Cubes." Contemp. Math. 166, 285-294, 1994.Conway, J. H. and Guy, R. K. The Book of Numbers. New York: Springer-Verlag, pp. 42-44, 1996.Davenport, H. "On Waring's Problem for Cubes." Acta Math. 71, 123-143, 1939.Demjanenko, V. "On Sums of Four Cubes." Izvesti Vischik Outchetsnik Zavedenii Math. 54, 64-69, 1966.Deshouillers, J.-M.; Hennecart, F.; and Landreau, B. "7 373 170 279 850." Math. Comput. 69, 421-439, 2000.Dickson, L. E. History of the Theory of Numbers, Vol. 2: Diophantine Analysis. New York: Dover, 2005.Elkies, N. D. "Rational Points Near Curves and Small Nonzero πŸ‘ |x^3-y^2|
via Lattice Reduction." In Algorithmic Number Theory. Proceedings of the 4th International Symposium (ANTS-IV) held at the Universiteit Leiden, Leiden, July 2-7, 2000 (Ed. W. Bosma). Berlin: Springer-Verlag, pp. 33-63, 2000. http://arxiv.org/abs/math.NT/0005139.
Elsenhaus, A.-S. and Jahnel, J. "List of Solutions of πŸ‘ x^3+y^3+z^3=n
for πŸ‘ n<1000
Neither a Cube Nor Twice a Cube." Apr. 19, 2007. http://www.uni-math.gwdg.de/jahnel/Arbeiten/Liste/threecubes_20070419.txt.
Elsenhaus, A.-S. and Jahnel, J. "New Sums of Three Cubes." Math. Comput. 78, 1227-1230, 2009.Gardiner, V. L.; Lazarus, R. B.; and Stein, P. R. "Solutions of the Diophantine Equation πŸ‘ x^3+y^3=z^3-d
." Math. Comput. 18, 408-413, 1964.
Gardner, M. "Mathematical Games: About Henry Ernest Dudeney, A Brilliant Creator of Puzzles." Sci. Amer. 198, 108-112, Jun. 1958.Guy, R. K. "Sum of Four Cubes." Β§D5 in Unsolved Problems in Number Theory, 2nd ed. New York: Springer-Verlag, pp. 151-152, 1994.Haddon, M. The Curious Incident of the Dog in the Night-Time. New York: Vintage, 2003.Hardy, G. H. and Wright, E. M. "Representation by Cubes and Higher Powers." Ch. 21 in An Introduction to the Theory of Numbers, 5th ed. Oxford, England: Clarendon Press, pp. 317-339, 1979.Heath-Brown, D. R.; Lioen, W. M.; and te Riele, H. J. J. "On Solving the Diophantine Equation πŸ‘ x^3+y^3+z^3=k
on a Vector Computer." Math. Comput. 61, 235-244, 1993.
Huisman, S. G. "Newer Sums of Three Cubes." 26 Apr 2016. https://arxiv.org/abs/1604.07746.Le Lionnais, F. Les nombres remarquables. Paris: Hermann, p. 53, 1983.Miller, J. C. P. and Woollett, M. F. C. "Solutions of the Diophantine Equation πŸ‘ x^3+y^3+z^3=k
." J. London Math. Soc. 30, 101-110, 1955.
Mishima, H. "πŸ‘ n=x^3+y^3+z^3
." http://www.asahi-net.or.jp/~kc2h-msm/mathland/math04/cube00.htm.
Mishima, H. "The Mathematician's Secret Room." http://www.asahi-net.or.jp/~KC2H-MSM/mathland/math04/cube00.htm.Pollock, F. "On the Extension of the Principle of Fermat's Theorem of the Polygonal Numbers to the Higher Orders of Series Whose Ultimate Differences Are Constant. With a New Theorem Proposed, Applicable to All the Orders." Abs. Papers Commun. Roy. Soc. London 5, 922-924, 1843-1850.Sloane, N. J. A. Sequences A000578/M4499, A001235, A001476, A002376/M0466, A003108/M0209, A003072, A003325, A003327, A003328, A003825, A003826, A007412/M0493, A011541, A018850, A018888, A018889, A018890, A025395, A046040, A046041, A046459, A048926, A048927, A048928, A048929, A048930, A048931, A048932, A057903, A057904, A057905, A057906, and A057907 in "The On-Line Encyclopedia of Integer Sequences."Wells, D. The Penguin Dictionary of Curious and Interesting Numbers. Middlesex, England: Penguin Books, p. 70, 1986.

Referenced on Wolfram|Alpha

Cubic Number

Cite this as:

Weisstein, Eric W. "Cubic Number." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CubicNumber.html

Subject classifications