- --- In primenumbers@yahoogroups.com, "djbroadhurst" wrote:

> How do you intend to prove that one pair of Pell's /infinite/

But it will not take for ever. It would be sufficient for

> series does not correspond to my choice, modulo p?

>

> That might take you some time :-?

Bernhard to study less than 960,000 integers from

http://oeis.org/A001075> a(n) solves for x in x^2 - 3*y^2 = 1

Of these, the largest has less than 550,000 digits:

{stop=ceil(15258151/16);digs=#Str(real(quadunit(12)^stop));

print(stop"th Pell number has "digs" decimal digits");}

953635th Pell number has 545429 decimal digits

Happy hunting :-)

David Bernhard Helmes wrote:

> the pell solution of x, y with x^2-ay^2=-1

For a=3 mod 4 there is no such thing.

Please do not post "tests" that refer

to non-existent entities.`David`