Methods to Find Integer Points on the Elliptic Curve of Factorizable Polynomial Equation
Abstract
As a valuable theoretical and application problem, the integer points on two types of elliptic curve y^2=(x-a)(x-b)(x-c) and y^2 = (x-a)(x^2+ax+b) are studied. By using elementary number theory method, the solution of the original equations is reduced to the solution of simultaneous Pell equations or generalized Pell equation, which can improve the efficiency in searching integer solutions by computer. Effective methods are proposed to find the integer solutions of the equations, which are convenient for algorithm programming implementation. At the same time, the derivation of the methods leads to two sufficient conditions, which can determine the unsolvability of these two types of equation respectively. The methods proposed are for equations with undetermined coefficients, which are more general than the solutions of the equations with specific known coefficients, and more suitable for computer programming implementation.
Versions
Related
- Hyperbolic Area Methods in Meromorphic Dynamics and Elliptic Polynomial Skew Products
- Integer points for iterated Weierstrass elliptic functions
- On the Krull dimensions of rings of integer-valued polynomials and polynomial rings
- A short proof of a range-relative FPTAS for polynomial integer optimization over bounded polyhedra
- Stacked-bases Properties, maximal ideals and polynomial closures of Rings of Integer-Valued Polynomials
BibTeX
@misc{zhuang2026methods,
title = {{Methods to Find Integer Points on the Elliptic Curve of Factorizable Polynomial Equation}},
author = {Xiaodong Zhuang and Nikos E. Mastorakis},
howpublished = {arXiv},
year = {2026},
month = sep,
doi = {10.48550/arxiv.2609.06559},
eprint = {2609.06559},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2609.06559},
note = {CC BY 4.0},
}
RIS
TY - UNPB
TI - Methods to Find Integer Points on the Elliptic Curve of Factorizable Polynomial Equation
AU - Xiaodong Zhuang
AU - Nikos E. Mastorakis
PY - 2026
DA - 2026/09/06
PB - arXiv
DO - 10.48550/arxiv.2609.06559
UR - https://arxiv.org/abs/2609.06559
AB - As a valuable theoretical and application problem, the integer points on two types of elliptic curve y^2=(x-a)(x-b)(x-c) and y^2 = (x-a)(x^2+ax+b) are studied. By using elementary number theory method, the solution of the original equations is reduced to the solution of simultaneous Pell equations or generalized Pell equation, which can improve the efficiency in searching integer solutions by computer. Effective methods are proposed to find the integer solutions of the equations, which are convenient for algorithm programming implementation. At the same time, the derivation of the methods leads to two sufficient conditions, which can determine the unsolvability of these two types of equation respectively. The methods proposed are for equations with undetermined coefficients, which are more general than the solutions of the equations with specific known coefficients, and more suitable for computer programming implementation.
ER -