> It tests it:

digits]

>

> 9*10^3 + 1 may be prime. (a = 2)

> 9*10^3 + 1 is prime ! (a = 7) [4 digits]

> 9*10^3 + 1 is prime ! (verification : a = 13) [4 digits]

> 9*10^3 - 1 may be prime. (a = 2)

> 9*10^3 - 1 is prime ! (P = 8, Q = -1) [4 digits]

> 9*10^3 - 1 may be prime. (P = 9, Q = -1)

> 9*10^3 - 1 is prime ! (verification : P = 12, Q = -1) [4

> - Twin -

Oh, yes!

>

> ???

I've just tried this with "Manual PMax" option disabled, and

all works OK.

But if I use this option (PMax=1048576), Proth doesn't want

to test some small numbers for existence of twin pair (and,

perhaps, another good pairs). Proth proves primality of them

with trial division and maybe therefore such bug occurs.

Best wishes,

Andrey

---

22 ЖЕЧТБМС TUT.BY РТЙЗМБЫБЕФ чБУ ОБ йОФЕТОЕФ-ЧЕЮЕТЙОЛХ www.y2kparty.com