- View SourceI have completed the search for Repunits from 86453 up to 200,000. No new repunits have been found, other than the previously announced PRP R(109297). The search took about 25 days using the equivalent of 7 computers of 3.0 GHz. I estimate that searching from 200,000 to 300,000 would take about twice this effort.

Although I was disappointed that no additional repunits were found, I am thoroughly impressed that the response to finding R(109297) seems to have been to reawaken interest in proving R(49081) truly prime. Good luck to everyone involved.

Harvey Dubner

[Non-text portions of this message have been removed] - View SourceYou should definitely upgrade to 3.3.6. There are a number of bug fixes to both gwnum (which is now 25.14) and PFGW. I consider 3.3.6 to be a stable release and not an alpha or a beta.

--Mark

On Mar 3, 2010, at 8:10 AM, Lélio Ribeiro de Paula wrote:

> >

> > On Mar 3, 2010, at 7:41 AM, Mark Rodenkirch wrote:

> >

> > >I do have one thing to report. I d/l'd the initial alpha release when

> > >George updated PFGW to gwnum v25. These problems started with that

> > >release and have gone undetected since then. I will need to work with

> > >George to resolve these issues since he is familiar with the changes

> > >he had to make to get PFGW to work with gwnum v25.

> >

> >

> >

>

> I´m still using one of the earliest Mark versions. Don't know if it's alpha,

> but it says

>

> PFGW Version 3.0.0 for Windows [FFT v25.10]

>

> Processing with "Default" stored parameters of: -l -n

>

> Primality testing (2^313+1)/3 [N-1/N+1, Brillhart-Lehmer-Selfridge]

>

> Running N-1 test using base 2

>

> Running N-1 test using base 3

>

> Running N-1 test using base 7

>

> Running N+1 test using discriminant 19, base 9+sqrt(19)

>

> Calling N-1 BLS with factored part 40.51% and helper 5.47% (127.33% proof)

>

> (2^313+1)/3 is prime! (0.0982s+0.0003s)

>

> Lélio

>

[Non-text portions of this message have been removed]