Pell equation

Pell equation

[′pel i‚kwā·zhən]
(mathematics)
The diophantine equation x 2-Dy 2= 1, with D a positive integer that is not a perfect square.
References in periodicals archive ?
2] = a, the equation becomes a Pell equation such that
Obviously the other variable of the Pell equation has the same recurrence relation.
Reflecting the wide used algorithmic and number theory in computer science, cryptography, and medicine, these 20 survey articles cover such topics as the Pell equation, basic algorithms and number theory, the quadratic sieve, primary testing algorithms, lattices, elliptic curves, number theory as an element of computational theory (and beyond), discrete logarithms, the effects of the number field sieve on discreet logarithms, finite fields, reducing the lattice basis to examine univariate polynomials, computing Arakelov class groups, computational class field theory, the algorithm theory of zeta functions over finite fields, congruent number problems and their variants, and an introduction to computing modular forms using modular symbols.