| | |
| | |
Stat |
Members: 3645 Articles: 2'500'096 Articles rated: 2609
17 April 2024 |
|
| | | |
|
Article overview
| |
|
On Hunting for Taxicab Numbers | Pavel Emelyanov
; | Date: |
8 Feb 2008 | Abstract: | 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 $nge3$. 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$. | Source: | arXiv, 0802.1147 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser claudebot
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |