Taxicab number

Last updated November 20, 2023

In mathematics, the nth taxicab number, typically denoted Ta(n) or Taxicab(n), is defined as the smallest integer that can be expressed as a sum of two positive integer cubes in n distinct ways.^[1] The most famous taxicab number is 1729 = Ta(2) = 1³ + 12³ = 9³ + 10³, also known as the Hardy-Ramanujan number.^[2]^[3]

I remember once going to see him [Ramanujan] when he was lying ill at Putney. I had ridden in taxi-cab No. 1729, and remarked that the number seemed to be rather a dull one, and that I hoped it was not an unfavourable omen. "No," he replied, "it is a very interesting number; it is the smallest number expressible as the sum of two [positive] cubes in two different ways."^[4]^[5]

History and definition

The pairs of summands of the Hardy–Ramanujan number Ta(2) = 1729 were first mentioned by Bernard Frénicle de Bessy, who published his observation in 1657. 1729 was made famous as the first taxicab number in the early 20th century by a story involving Srinivasa Ramanujan in claiming it to be the smallest for his particular example of two summands. In 1938, G. H. Hardy and E. M. Wright proved that such numbers exist for all positive integers n, and their proof is easily converted into a program to generate such numbers. However, the proof makes no claims at all about whether the thus-generated numbers are the smallest possible and so it cannot be used to find the actual value of Ta(n).

The taxicab numbers subsequent to 1729 were found with the help of computers. John Leech obtained Ta(3) in 1957. E. Rosenstiel, J. A. Dardis and C. R. Rosenstiel found Ta(4) in 1989.^[6] J. A. Dardis found Ta(5) in 1994 and it was confirmed by David W. Wilson in 1999.^[7]^[8] Ta(6) was announced by Uwe Hollerbach on the NMBRTHRY mailing list on March 9, 2008,^[9] following a 2003 paper by Calude et al. that gave a 99% probability that the number was actually Ta(6).^[10] Upper bounds for Ta(7) to Ta(12) were found by Christian Boyer in 2006.^[11]

The restriction of the summands to positive numbers is necessary, because allowing negative numbers allows for more (and smaller) instances of numbers that can be expressed as sums of cubes in n distinct ways. The concept of a cabtaxi number has been introduced to allow for alternative, less restrictive definitions of this nature. In a sense, the specification of two summands and powers of three is also restrictive; a generalized taxicab number allows for these values to be other than two and three, respectively.

Known taxicab numbers

So far, the following 6 taxicab numbers are known:

{\begin{aligned}\operatorname {Ta} (1)=&\ 2\\&=1^{3}+1^{3}\\[6pt]\operatorname {Ta} (2)=&\ 1729\\&=1^{3}+12^{3}\\&=9^{3}+10^{3}\\[6pt]\operatorname {Ta} (3)=&\ 87539319\\&=167^{3}+436^{3}\\&=228^{3}+423^{3}\\&=255^{3}+414^{3}\\[6pt]\operatorname {Ta} (4)=&\ 6963472309248\\&=2421^{3}+19083^{3}\\&=5436^{3}+18948^{3}\\&=10200^{3}+18072^{3}\\&=13322^{3}+16630^{3}\\[6pt]\operatorname {Ta} (5)=&\ 48988659276962496\\&=38787^{3}+365757^{3}\\&=107839^{3}+362753^{3}\\&=205292^{3}+342952^{3}\\&=221424^{3}+336588^{3}\\&=231518^{3}+331954^{3}\\[6pt]\operatorname {Ta} (6)=&\ 24153319581254312065344\\&=582162^{3}+28906206^{3}\\&=3064173^{3}+28894803^{3}\\&=8519281^{3}+28657487^{3}\\&=16218068^{3}+27093208^{3}\\&=17492496^{3}+26590452^{3}\\&=18289922^{3}+26224366^{3}\end{aligned}}

Upper bounds for taxicab numbers

For the following taxicab numbers upper bounds are known:

{\begin{aligned}\operatorname {Ta} (7)\leq &\ 24885189317885898975235988544\\&=2648660966^{3}+1847282122^{3}\\&=2685635652^{3}+1766742096^{3}\\&=2736414008^{3}+1638024868^{3}\\&=2894406187^{3}+860447381^{3}\\&=2915734948^{3}+459531128^{3}\\&=2918375103^{3}+309481473^{3}\\&=2919526806^{3}+58798362^{3}\\[6pt]\operatorname {Ta} (8)\leq &\ 50974398750539071400590819921724352\\&=299512063576^{3}+288873662876^{3}\\&=336379942682^{3}+234604829494^{3}\\&=341075727804^{3}+224376246192^{3}\\&=347524579016^{3}+208029158236^{3}\\&=367589585749^{3}+109276817387^{3}\\&=370298338396^{3}+58360453256^{3}\\&=370633638081^{3}+39304147071^{3}\\&=370779904362^{3}+7467391974^{3}\\[6pt]\operatorname {Ta} (9)\leq &\ 136897813798023990395783317207361432493888\\&=41632176837064^{3}+40153439139764^{3}\\&=46756812032798^{3}+32610071299666^{3}\\&=47409526164756^{3}+31188298220688^{3}\\&=48305916483224^{3}+28916052994804^{3}\\&=51094952419111^{3}+15189477616793^{3}\\&=51471469037044^{3}+8112103002584^{3}\\&=51518075693259^{3}+5463276442869^{3}\\&=51530042142656^{3}+4076877805588^{3}\\&=51538406706318^{3}+1037967484386^{3}\\[6pt]\operatorname {Ta} (10)\leq &\ 7335345315241855602572782233444632535674275447104\\&=15695330667573128^{3}+15137846555691028^{3}\\&=17627318136364846^{3}+12293996879974082^{3}\\&=17873391364113012^{3}+11757988429199376^{3}\\&=18211330514175448^{3}+10901351979041108^{3}\\&=19262797062004847^{3}+5726433061530961^{3}\\&=19404743826965588^{3}+3058262831974168^{3}\\&=19422314536358643^{3}+2059655218961613^{3}\\&=19426825887781312^{3}+1536982932706676^{3}\\&=19429379778270560^{3}+904069333568884^{3}\\&=19429979328281886^{3}+391313741613522^{3}\\[6pt]\operatorname {Ta} (11)\leq &\ 2818537360434849382734382145310807703728251895897826621632\\&=11410505395325664056^{3}+11005214445987377356^{3}\\&=12815060285137243042^{3}+8937735731741157614^{3}\\&=12993955521710159724^{3}+8548057588027946352^{3}\\&=13239637283805550696^{3}+7925282888762885516^{3}\\&=13600192974314732786^{3}+6716379921779399326^{3}\\&=14004053464077523769^{3}+4163116835733008647^{3}\\&=14107248762203982476^{3}+2223357078845220136^{3}\\&=14120022667932733461^{3}+1497369344185092651^{3}\\&=14123302420417013824^{3}+1117386592077753452^{3}\\&=14125159098802697120^{3}+657258405504578668^{3}\\&=14125594971660931122^{3}+284485090153030494^{3}\\[6pt]\operatorname {Ta} (12)\leq &\ 73914858746493893996583617733225161086864012865017882136931801625152\\&=33900611529512547910376^{3}+32696492119028498124676^{3}\\&=38073544107142749077782^{3}+26554012859002979271194^{3}\\&=38605041855000884540004^{3}+25396279094031028611792^{3}\\&=39334962370186291117816^{3}+23546015462514532868036^{3}\\&=40406173326689071107206^{3}+19954364747606595397546^{3}\\&=41606042841774323117699^{3}+12368620118962768690237^{3}\\&=41912636072508031936196^{3}+6605593881249149024056^{3}\\&=41950587346428151112631^{3}+4448684321573910266121^{3}\\&=41960331491058948071104^{3}+3319755565063005505892^{3}\\&=41965847682542813143520^{3}+1952714722754103222628^{3}\\&=41965889731136229476526^{3}+1933097542618122241026^{3}\\&=41967142660804626363462^{3}+845205202844653597674^{3}\end{aligned}}

Cubefree taxicab numbers

A more restrictive taxicab problem requires that the taxicab number be cubefree, which means that it is not divisible by any cube other than 1³. When a cubefree taxicab number $T$ is written as $T = x 3 + y 3$ , the numbers $x$ and $y$ must be relatively prime. Among the taxicab numbers $Ta(n)$ listed above, only $Ta(1)$ and $Ta(2)$ are cubefree taxicab numbers. The smallest cubefree taxicab number with three representations was discovered by Paul Vojta (unpublished) in 1981 while he was a graduate student:

{\begin{aligned}15170835645&=517^{3}+2468^{3}\\&=709^{3}+2456^{3}\\&=1733^{3}+2152^{3}\end{aligned}}

The smallest cubefree taxicab number with four representations was discovered by Stuart Gascoigne and independently by Duncan Moore in 2003:

{\begin{aligned}1801049058342701083&=92227^{3}+1216500^{3}\\&=136635^{3}+1216102^{3}\\&=341995^{3}+1207602^{3}\\&=600259^{3}+1165884^{3}\end{aligned}}

(sequence A080642 in the OEIS ).

Notes

↑ "Taxicab Number". Wolfram Mathworld.
↑ "Hardy-Ramanujan Number". Wolfram Mathworld.
↑ Grime, James; Bowley, Roger. Haran, Brady (ed.). 1729: Taxi Cab Number or Hardy-Ramanujan Number. Numberphile.
↑ Quotations by G. H. Hardy, MacTutor History of Mathematics Archived 2012-07-16 at the Wayback Machine
↑ Silverman, Joseph H. (1993). "Taxicabs and sums of two cubes". Amer. Math. Monthly. 100 (4): 331–340. doi:10.2307/2324954. JSTOR 2324954.
↑ Numbers Count column, Personal Computer World, page 234, November 1989
↑ Numbers Count column of Personal Computer World, page 610, Feb 1995
↑ "The Fifth Taxicab Number is 48988659276962496" by David W. Wilson
↑ NMBRTHRY Archives – March 2008 (#10) "The sixth taxicab number is 24153319581254312065344" by Uwe Hollerbach
↑ C. S. Calude, E. Calude and M. J. Dinneen: What is the value of Taxicab(6)?, Journal of Universal Computer Science, Vol. 9 (2003), pp. 1196–1203
↑ "'New Upper Bounds for Taxicab and Cabtaxi Numbers" Christian Boyer, France, 2006–2008

Related Research Articles

In number theory, an arithmetic, arithmetical, or number-theoretic function is for most authors any function f(n) whose domain is the positive integers and whose range is a subset of the complex numbers. Hardy & Wright include in their definition the requirement that an arithmetical function "expresses some arithmetical property of n".

<span class="mw-page-title-main">Diophantine equation</span> Polynomial equation whose integer solutions are sought

In mathematics, a Diophantine equation is an equation, typically a polynomial equation in two or more unknowns with integer coefficients, such that the only solutions of interest are the integer ones. A linear Diophantine equation equates to a constant the sum of two or more monomials, each of degree one. An exponential Diophantine equation is one in which unknowns can appear in exponents.

In number theory, Euler's conjecture is a disproved conjecture related to Fermat's Last Theorem. It was proposed by Leonhard Euler in 1769. It states that for all integers $n$ and $k$ greater than 1, if the sum of $n$ many $k$ th powers of positive integers is itself a $k$ th power, then $n$ is greater than or equal to $k$ :

In mathematics, a transcendental number is a real or complex number that is not algebraic – that is, not the root of a non-zero polynomial of finite degree with rational coefficients. The best known transcendental numbers are $π$ and $e$ .

In number theory, Waring's problem asks whether each natural number k has an associated positive integer s such that every natural number is the sum of at most s natural numbers raised to the power k. For example, every natural number is the sum of at most 4 squares, 9 cubes, or 19 fourth powers. Waring's problem was proposed in 1770 by Edward Waring, after whom it is named. Its affirmative answer, known as the Hilbert–Waring theorem, was provided by Hilbert in 1909. Waring's problem has its own Mathematics Subject Classification, 11P05, "Waring's problem and variants".

<span class="mw-page-title-main">Cube (algebra)</span> Number raised to the third power

In arithmetic and algebra, the cube of a number $n$ is its third power, that is, the result of multiplying three instances of $n$ together. The cube of a number or any other mathematical expression is denoted by a superscript 3, for example 2³ = 8 or $(x + 1) 3$ .

A powerful number is a positive integer m such that for every prime number p dividing m, p² also divides m. Equivalently, a powerful number is the product of a square and a cube, that is, a number m of the form m = a²b³, where a and b are positive integers. Powerful numbers are also known as squareful, square-full, or 2-full. Paul Erdős and George Szekeres studied such numbers and Solomon W. Golomb named such numbers powerful.

The interesting number paradox is a humorous paradox which arises from the attempt to classify every natural number as either "interesting" or "uninteresting". The paradox states that every natural number is interesting. The "proof" is by contradiction: if there exists a non-empty set of uninteresting natural numbers, there would be a smallest uninteresting number – but the smallest uninteresting number is itself interesting because it is the smallest uninteresting number, thus producing a contradiction.

In number theory, a formula for primes is a formula generating the prime numbers, exactly and without exception. No such formula which is efficiently computable is known. A number of constraints are known, showing what such a "formula" can and cannot be.

1729 is the natural number following 1728 and preceding 1730. It is notably the first nontrivial taxicab number.

In number theory, the generalized taxicab number $Taxicab(k, j, n)$ is the smallest number — if it exists — that can be expressed as the sum of $j$ numbers to the $k$ th positive power in $n$ different ways. For $k = 3$ and $j = 2$ , they coincide with taxicab number.

In mathematics, in the field of number theory, the Ramanujan–Nagell equation is an equation between a square number and a number that is seven less than a power of two. It is an example of an exponential Diophantine equation, an equation to be solved in integers where one of the variables appears as an exponent.

1728 is the natural number following 1727 and preceding 1729. It is a dozen gross, or one great gross. It is also the number of cubic inches in a cubic foot.

In number theory, Ramanujan's sum, usually denoted c_q(n), is a function of two positive integer variables q and n defined by the formula

Brocard's problem is a problem in mathematics that seeks integer values of $such that is a perfect square, where is the factorial. Only three values of are known — 4, 5, 7 — and it is not known whether there are any more.$

In mathematics and statistics, sums of powers occur in a number of contexts:

The Lander, Parkin, and Selfridge conjecture concerns the integer solutions of equations which contain sums of like powers. The equations are generalisations of those considered in Fermat's Last Theorem. The conjecture is that if the sum of some k-th powers equals the sum of some other k-th powers, then the total number of terms in both sums combined must be at least k.

In the mathematics of sums of powers, it is an open problem to characterize the numbers that can be expressed as a sum of three cubes of integers, allowing both positive and negative cubes in the sum. A necessary condition for an integer $to equal such a sum is that cannot equal 4 or 5 modulo 9, because the cubes modulo 9 are 0, 1, and -1, and no three of these numbers can sum to 4 or 5 modulo 9. It is unknown whether this necessary condition is sufficient.$

In mathematics, the sum of two cubes is a cubed number added to another cubed number.

References

G. H. Hardy and E. M. Wright, An Introduction to the Theory of Numbers, 3rd ed., Oxford University Press, London & NY, 1954, Thm. 412.
J. Leech, Some Solutions of Diophantine Equations, Proc. Camb. Phil. Soc. 53, 778–780, 1957.
E. Rosenstiel, J. A. Dardis and C. R. Rosenstiel, The four least solutions in distinct positive integers of the Diophantine equations = x³ + y³ = z³ + w³ = u³ + v³ = m³ + n³, Bull. Inst. Math. Appl., 27(1991) 155–157; MR 1125858, online.
David W. Wilson, The Fifth Taxicab Number is 48988659276962496, Journal of Integer Sequences, Vol. 2 (1999), online. (Wilson was unaware of J. A. Dardis' prior discovery of Ta(5) in 1994 when he wrote this.)
D. J. Bernstein, Enumerating solutions to $p(a)+q(b)=r(c)+s(d)$ , Mathematics of Computation 70, 233 (2000), 389–394.
C. S. Calude, E. Calude and M. J. Dinneen: What is the value of Taxicab(6)?, Journal of Universal Computer Science, Vol. 9 (2003), p. 1196–1203

External links

A 2002 post to the Number Theory mailing list by Randall L. Rathbun
Grime, James; Bowley, Roger. Haran, Brady (ed.). 1729: Taxi Cab Number or Hardy-Ramanujan Number. Numberphile.
Taxicab and other maths at Euler
Singh, Simon. Haran, Brady (ed.). "Taxicab Numbers in Futurama". Numberphile.

This page is based on this Wikipedia article
Text is available under the CC BY-SA 4.0 license; additional terms may apply.
Images, videos and audio are available under their respective licenses.

[1] "Taxicab Number". Wolfram Mathworld.

[2] "Hardy-Ramanujan Number". Wolfram Mathworld.

[3] Grime, James; Bowley, Roger. Haran, Brady (ed.). 1729: Taxi Cab Number or Hardy-Ramanujan Number. Numberphile.

[4] Quotations by G. H. Hardy, MacTutor History of Mathematics Archived 2012-07-16 at the Wayback Machine

[5] Silverman, Joseph H. (1993). "Taxicabs and sums of two cubes". Amer. Math. Monthly. 100 (4): 331–340. doi:10.2307/2324954. JSTOR 2324954.

[6] Numbers Count column, Personal Computer World, page 234, November 1989

[7] Numbers Count column of Personal Computer World, page 610, Feb 1995

[8] "The Fifth Taxicab Number is 48988659276962496" by David W. Wilson

[9] NMBRTHRY Archives – March 2008 (#10) "The sixth taxicab number is 24153319581254312065344" by Uwe Hollerbach

[10] C. S. Calude, E. Calude and M. J. Dinneen: What is the value of Taxicab(6)?, Journal of Universal Computer Science, Vol. 9 (2003), pp. 1196–1203

[11] "'New Upper Bounds for Taxicab and Cabtaxi Numbers" Christian Boyer, France, 2006–2008

[1]

[2]

[3]

[4]

[5]

[6]

[7]

[8]

[9]

[10]

[11]