An Algorithm to Find Rational Points on Elliptic Curves Related to the Concordant Form Problem
Hagen Knaf, Erich Selder, Karlheinz Spindler
TL;DR
This paper presents an efficient algorithm for finding rational points on elliptic curves related to Euler's concordant form problem, advancing computational methods in number theory.
Contribution
The paper introduces a novel algorithm specifically designed to solve Euler's concordant form problem by identifying rational points on associated elliptic curves.
Findings
Algorithm successfully finds rational points on elliptic curves
Improves computational efficiency over previous methods
Enables new solutions to Euler's concordant form problem
Abstract
We derive an efficient algorithm to find solutions to Euler's concordant form problem and rational points on elliptic curves associated with this problem.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Polynomial and algebraic computation · Cryptography and Residue Arithmetic