References in periodicals archive ?
The authors have organized the main body of their text in nine chapters devoted to triangular, oblong, perfect, deficient, and abundant numbers, the Fibonacci sequence, primes, and the Pell equation, PascalEs triangle, and a wide variety of other related subjects.
2] = a, the equation becomes a Pell equation such that
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.
The problem of finding all nearly isosceles right triangles can be solved using a Pell equation (Dye, 1998) and this connection is worth investigating too.
If u = p[lambda], then the corresponding Pell equation is also [U.