REVIEW
On Hunting for Taxicab Numbers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
On Hunting for Taxicab Numbers
read the original 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 $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$.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.