Beta test project found new primes

[ltd]

There are good news and bad news from the beta project.

The bad news is that my automatic code for checking llrnet results for primes
and block them from sending out does not work.
Programming error on my side

The good news is that spooty found two top 5000 primes

263329*2^406934+1 is a probable prime. 2006.08.05
943373*2^304161+1 is a probable prime. 2006.07.27

I have already done crosschecks on my system and they are also reported prime. They will be reported to chris when Spooty has his prover code.

Hope we find a prime in the main project soon.

Lars

[Citrix]

Spooty beat me to it. I guess I do not have to do the testing work.

Please report the primes to Joe Mclean as well.

Congrats Spooty.

[ltd]

Originally Posted by Citrix

Spooty beat me to it. I guess I do not have to do the testing work.

Please report the primes to Joe Mclean as well.

Congrats Spooty.

Do you have his mail address? I did not see it on his page.

Lars

[Citrix]

Originally Posted by ltd

Do you have his mail address? I did not see it on his page.

Lars

I will have to search my old email account, as far as I remember, I deleted all the emails in my old account. Sorry.

[Citrix]

I think we should add 2 more k's with weight greater than 200 into the beta project. May be we can do something like this, that when a prime is found the computer adds 1 more k into the project.

It is very easy to write a program to generate k's which have no prime associated with them till n=5000 and weight greater than 200. The computer would just add the new k on each prime found. But some one would have to sieve, say the next 10 possible candidates and then the presieved files would have to be stored on the server.

If the k reaches n=1M, we can retire the k and start on a new one.

What do you think?

PS: Since Joe Mclean was searching till k=1M, may be we can start at k=1M.

edit:One more thing, for the primes found should the PSP project be given credit? Technically the k's are not part of our project, but they were found by a PSP user, and on the PSP server? Any thoughts?

[ltd]

I already told Spooty to create a prover code which contains the PSP project cause there was alot of work done by the PSP community to find the primes.

I don't think we should add new n to the beta project. It has the purpose to test new scripts and new software versions without endangering the main project. This can be done with 5 k as well. I do not see any reason for the additional work to coordinate presieving.

And if the beta project finds enough primes that we need more k to have a serious test environment we can still ask Joe Mclean if there are other abandoned k <1M.

Lars

[Spooty]

Hi, I know the beta project grabbed a few values from Joe McLean's "Sierpinski Search to One Million".

In particular, I found two primes in the last two months that knock off two values from his list at http://www.glasgowg43.freeserve.co.uk/siersurv.htm

But his list hasn't been updated since "10-01-06" (Jan. 10th), and I know a few other primes have been found by Riesel Sieve, etc.

Is anybody in contact with him, and/or know why the list is so out-of-date? It sort of bugs me....

[ltd]

I have tried to contact him via an mail address i found in the internet immediate after we found those prime but there was no reaction. Maybe it was the wrong address?

Lars