On Hunting for Taxicab Numbers
| dc.creator | Emelyanov, Pavel | |
| dc.date | 2008-02-08 | |
| dc.date.accessioned | 2026-07-07T09:19:35Z | |
| dc.date.available | 2026-07-07T09:19:35Z | |
| dc.description | In this article, we make use of some known method to investigate some properties of the numbers represented as sums of two equal odd powers, i.e., the equation $x^n+y^n=N$ for $n\ge3$. It was originated in developing algorithms to search new taxicab numbers (i.e., naturals that can be represented as a sum of positive cubes in many different ways) and to verify their minimality. We discuss properties of diophantine equations that can be used for our investigations. This techniques is applied to develop an algorithm allowing us to compute new taxicab numbers (i.e., numbers represented as sums of two positive cubes in $k$ different ways), for $k=7...14$. | |
| dc.description | 1 table, 1 appendix | |
| dc.identifier | https://arxiv.org/abs/0802.1147 | |
| dc.identifier | http://arxiv.org/abs/0802.1147 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/154442 | |
| dc.subject | Number Theory | |
| dc.subject | 11A07; 11D25; 11D41; 11Y50; 11Y55 | |
| dc.title | On Hunting for Taxicab Numbers | |
| dc.type | text |