Midpoint criteria for solving Pell’s equation using the nearest square continued fraction
From MaRDI portal
Publication:3584786
DOI10.1090/S0025-5718-09-02286-8zbMath1216.11037OpenAlexW1970976002MaRDI QIDQ3584786
John P. Robertson, Jim White, Keith R. Matthews
Publication date: 30 August 2010
Published in: Mathematics of Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1090/s0025-5718-09-02286-8
Quadratic and bilinear Diophantine equations (11D09) Computer solution of Diophantine equations (11Y50) Continued fractions (11A55) Continued fraction calculations (number-theoretic aspects) (11Y65)
Uses Software
Cites Work
- On the metric theory of nearest integer continued fractions
- Period-length equality for the nearest integer and nearest square continued fraction expansions of a quadratic surd
- Über die mittlere Schrittanzahl bei Divisionsalgorithmen
- Calculation of the Regulator of Q(√D) by use of the Nearest Integer Continued Fraction Algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Midpoint criteria for solving Pell’s equation using the nearest square continued fraction