The Diophantine equation x^2 - Dy^2 = N, D>0
The author discusses an algorithm by Lagrange, inspied by this reviewer's presentation in ``Fundamental number theory with applications [CRC Press (1998; Zbl 0943.11001), 333-340]. The algorithm describes how to solve the Diophantine equation \(x^2- Dy^2= N\) for any integer \(N\) and any nonsquare positive integer \(D\). The author presents an approach that uses only continued fractions, which is less complicated than that presented by this reviewer in the above. At the end of the paper there are illustrations presented using some software developed by the author. The paper is well-written and inspired this reviewer to simplify the algorithm even further in [Simple continued fraction solutions to Diophantine equations, Expo. Math. 19, 55-73 (2001; Zbl 0983.11010)].
- The Diophantine equation xn= Dy2+1
- The diophantine equation \(x^2+D=p^n\)
- The diophantine equation x² + C = yⁿ
- On the Diophantine equation \(x^2 - Dy^2 = n\)
- The Diophantine equation x^2 + B^m = y^n
- The diophantine equation $x^{2} + D^{m} = p^{n}$
- scientific article; zbMATH DE number 827959
- The Diophantine equation \(ax^2+bxy+cy^2=N\), \(D=b^2-4ac>0\)
- On the Diophantine Equation x 2n - y 2 = 1
- The Diophantine Equation x 2 + y m = z 2n
- The Diophantine equation \(ax^2+bxy+cy^2=N\), \(D=b^2-4ac>0\)
- Pell-type equations and class number of the maximal real subfield of a cyclotomic field
- On the solution of \(x^2+dy^2=m\)
- Cornacchia's algorithm
- A taxonomy of pairing-friendly elliptic curves
- The Diophantine equation \(x^2-(t^2+t)y^2- (4t+2)x+(4t^2+4t)y=0\)
- General solutions of sums of consecutive cubed integers equal to squared integers
- Bisecting binomial coefficients
- A problem in Diophantine approximation found in Ramanujan's lost notebook
- Generalized Lagrange criteria for certain quadratic Diophantine equations
- The polynomial solutions of quadratic Diophantine equation \(X^2-p(t)Y^2 + 2K(t)X+2p(t) L(t)Y = 0\)
- Quadratic ideals, indefinite quadratic forms and some specific Diophantine equations
- scientific article; zbMATH DE number 2065022 (Why is no real title available?)
- Solution of certain Pell equations
- All square chiliagonal numbers
- scientific article; zbMATH DE number 6119124 (Why is no real title available?)
- Lagrange's algorithm revisited: solving at^2 + btu + cu^2 = n in the case of negative discriminant
- A characterization of strongly computable finite factorization domains
This page was built for publication: The Diophantine equation \(x^2 - Dy^2 = N\), \(D>0\)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1589976)
