The upper bound estimate of the number of integer points on elliptic curves \(y^2=x^3+p^{2r}x\)

DOI10.1186/1029-242X-2014-104zbMath1371.11101OpenAlexW2100401202WikidataQ59324079 ScholiaQ59324079MaRDI QIDQ2405592

Jin Zhang, Xiaoxue Li

Publication date: 26 September 2017

Published in: Journal of Inequalities and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1186/1029-242x-2014-104

zbMATH Keywords

elliptic curveDiophantine equationinteger point

Mathematics Subject Classification ID

Elliptic curves over global fields (11G05) Computer solution of Diophantine equations (11Y50)

Cites Work

• Unnamed Item
• Integer solutions to the equation \(y^2=x(x^2\pm p^k)\)
• On the Equation Y 2 = X(X 2 + p)
• The Diophantine equation 𝑥⁴+1=𝐷𝑦²
• Integer points on the curve $Y^{2}=X^{3}\pm p^{k}X$

This page was built for publication: The upper bound estimate of the number of integer points on elliptic curves \(y^2=x^3+p^{2r}x\)