Efficient Solution of Rational Conics
We present efficient algorithms for solving Legendre equations over Q (equivalently, for finding rational points on rational conics) and parametrizing all solutions. Unlike existing algorithms, no integer factorization is required, provided that the prime factors of the discriminant are known.
| Main Authors: | , |
|---|---|
| Format: | Article |
| Published: |
American Mathematical Society
2001
|
| Online Access: | http://eprints.nottingham.ac.uk/60/ http://eprints.nottingham.ac.uk/60/3/conics.ps http://eprints.nottingham.ac.uk/60/1/kvxefz87.pdf |