What is the Value of Taxicab(6)?
| dc.creator | Calude,Cristian S. | |
| dc.creator | Calude,Elena | |
| dc.creator | Dinneen,Michael | |
| dc.date | 2003 | |
| dc.date.accessioned | 2024-02-06T12:52:36Z | |
| dc.date.available | 2024-02-06T12:52:36Z | |
| dc.description | 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 [10 18 , 24153319581254312065344]. In this note we show that with probability greater than 99%, Taxicab(6) = 24153319581254312065344. | |
| dc.format | text/html | |
| dc.identifier | https://doi.org/10.3217/jucs-009-10-1196 | |
| dc.identifier | https://lib.jucs.org/article/28119/ | |
| dc.identifier.uri | https://openrepository.mephi.ru/handle/123456789/8421 | |
| dc.language | en | |
| dc.publisher | Journal of Universal Computer Science | |
| dc.relation | info:eu-repo/semantics/altIdentifier/eissn/0948-6968 | |
| dc.relation | info:eu-repo/semantics/altIdentifier/pissn/0948-695X | |
| dc.rights | info:eu-repo/semantics/openAccess | |
| dc.rights | J.UCS License | |
| dc.source | JUCS - Journal of Universal Computer Science 9(10): 1196-1203 | |
| dc.subject | Hardy-Ramanujan Number | |
| dc.subject | Taxicab Number | |
| dc.subject | sampling | |
| dc.title | What is the Value of Taxicab(6)? | |
| dc.type | Research Article |