dc.contributor.author |
Calude, C.S |
en |
dc.contributor.author |
Calude, E |
en |
dc.contributor.author |
Dinneen, Michael |
en |
dc.date.accessioned |
2009-04-16T23:13:53Z |
en |
dc.date.available |
2009-04-16T23:13:53Z |
en |
dc.date.issued |
2003-05 |
en |
dc.identifier.citation |
CDMTCS Research Reports CDMTCS-217 (2003) |
en |
dc.identifier.issn |
1178-3540 |
en |
dc.identifier.uri |
http://hdl.handle.net/2292/3724 |
en |
dc.description.abstract |
For almost 350 years it was known that 1729 is the smallest integer which
can be expressed as the sum of two positive cubes in two different ways. Motivated
by a famous story involving Hardy and Ramanujan, a class of numbers called Taxicab
Numbers has been defined: Taxicab(k, j, n) is the smallest number which can
be expressed as the sum of j kth powers in n different ways. So, Taxicab(3, 2, 2) =
1729; Taxicab(4, 2, 2) = 635318657. Computing Taxicab Numbers is challenging and
interesting, both from mathematical and programming points of view.
The exact value of Taxicab(6) = Taxicab(3, 2, 6) is not known; however, recent
results announced by Rathbun [R2002] show that Taxicab(6) is in the interval
[1¹⁸, 24153319581254312065344]. In this note we show that with probability greater
than 99%, Taxicab(6) = 24153319581254312065344. |
en |
dc.publisher |
Department of Computer Science, The University of Auckland, New Zealand |
en |
dc.relation.ispartofseries |
CDMTCS Research Report Series |
en |
dc.rights.uri |
https://researchspace.auckland.ac.nz/docs/uoa-docs/rights.htm |
en |
dc.source.uri |
http://www.cs.auckland.ac.nz/staff-cgi-bin/mjd/secondcgi.pl?serial |
en |
dc.title |
What is the Value of Taxicab(6)? |
en |
dc.type |
Technical Report |
en |
dc.subject.marsden |
Fields of Research::280000 Information, Computing and Communication Sciences |
en |
dc.rights.holder |
The author(s) |
en |
dc.rights.accessrights |
http://purl.org/eprint/accessRights/OpenAccess |
en |