An exact upper bound estimate for the number of integer points on the elliptic curves \(y^2= x^3-p^k x\)

DOI10.1186/1029-242X-2014-187zbMath1371.11098OpenAlexW1996150911WikidataQ59323680 ScholiaQ59323680MaRDI QIDQ2405630

Su Gou, 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-187

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
• Complete solution of the diophantine equation \(X^ 2+1=dY^ 4\) and a related family of quartic Thue equations
• Integer points and independent points on the elliptic curve \(y^2=x^3-p^kx\)
• Integer solutions to the equation \(y^2=x(x^2\pm p^k)\)
• Maximal ranks and integer points on a family of elliptic curves
• THE DIOPHANTINE EQUATION A⁴ + 2^δB² = Cⁿ
• Ternary Diophantine Equations via Galois Representations and Modular Forms
• Integer points on the curve $Y^{2}=X^{3}\pm p^{k}X$

This page was built for publication: An exact upper bound estimate for the number of integer points on the elliptic curves \(y^2= x^3-p^k x\)