arXiv (All)
open access
Methods to Find Integer Points on the Elliptic Curve of Factorizable Polynomial Equation
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 o
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Elliptic Curve Cryptography Subject Public Key Information#501068
- Clarifications for Elliptic Curve Cryptography Subject Public Key Information#502411
- The Hessian of elliptic curves as a Lattès map#1050725
- Power-saving bounds for Thue--Mahler and Mordell equations#974560
- On the ring of unipotent vector bundles on elliptic curves in positive characteristics#1011905
Record · ID 974673
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive