Published August 29, 2022
| Version v1
Preprint
Open
Modular cubic sequence pattern and its application to the Diophantine equation $X^3+Y^3+Z^3=K$
Description
We propose a new sequence-based algorithm to track and find solutions to the Diophantine equation $X^3+Y^3+Z^3=k$, for a fixed integer $k > 0$.
Files
ASCM_v2-1.pdf
Files
(209.3 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:f469d0ce55f2d5b90203043496111997
|
209.3 kB | Preview Download |