[QUOTE=3.14159;227628]I guess I am unable to do much uploading, as the network is failing yet again.[/QUOTE]

Not a big deal -- you're the one doing the calculation at the moment, and as long as that work is able to continue there's no problem in waiting a day, or even a week, to update.

[QUOTE=CRGreathouse]Not a big deal -- you're the one doing the calculation at the moment, and as long as that work is able to continue there's no problem in waiting a day, or even a week, to update.[/QUOTE]

Any programs that you would recommend me using for the larger primes?

My current idea is NewPGen + PFGW + Proving it prime with Proth.exe

And:

912646 * 798336[sup]20160[/sup] + 1 is prime! :party: (Approx. 119000 digits)

[QUOTE=3.14159;227630]Any programs that you would recommend me using for the larger primes?[/QUOTE]

Not particularly. As long as your basic setup is sieve + probable prime test + primality proving, you're pretty well set.

Now, that find lifted a load of CPU usage off the computer. :smile: It reduced it by 40% !

[QUOTE=CRGreathouse]Not particularly. As long as your basic setup is sieve + probable prime test + primality proving, you're pretty well set.
[/QUOTE]

Sieve: NewPGen or Vk.

PRP Test: PFGW or LLR.

Primality proof: Proth.exe (Items 1, 2, 3, 4, 8, 9, 10, 11, 12, 13, 14, 15)

Okay: Past 250, programs will be put into use; The primes reach 600 digits by b = 250. Or begin using "isPRP", for PARI.

[QUOTE=3.14159;227634]Or begin using "isPRP", for PARI.[/QUOTE]

Probably better to use ispseudoprime(), which does a small amount of trial division then a BPSW test. It's coded directly in C which means you get about the same speed as isPRP but a much stronger test.

Okay: Completed the file for b = 60 to 250.

Now: For 251 to 500.

[QUOTE=3.14159;227464]Other members only:

20. n-1 analogues of Proths.
21. n-1 analogues of k-b-b, (k * b[sup]b[/sup] - 1)
22. Twins.

I stay within 1-19. Ban me for a week if I defy that rule.[/QUOTE]

Since Pi's not allowed to participate and no one else has stepped forward, I'll submit 1 * 2^2 - 1 = 3 for #20 and #21 and 3 = 5 - 2 for #22. Primality certificates available on request.

obviously even though you told me to post again you don't care of my idea.

[QUOTE=science_man_88;227663]obviously even though you told me to post again you don't care of my idea.[/QUOTE]

I can't make heads or tails of it.

turn this into vectors:

[CODE]for(s=1,50,for(x=s,20000000*s,if(isprime(x),print1(x","));x=x*2);print("<--"s))[/CODE]

then compare with the exponents of Mersenne primes.

some don't fit them so we could say they may never hit them. if we can figure this out we can use it like a sieve.

[CODE]3,7,31,127,8191,131071,524287,<--1
2,5,11,23,47,191,383,6143,786431,<--2
3,7,31,127,8191,131071,524287,<--3
19,79,1279,5119,20479,81919,1310719,<--4
5,11,23,47,191,383,6143,786431,<--5
13,223,3583,917503,14680063,<--6
7,31,127,8191,131071,524287,<--7
17,71,1151,73727,294911,18874367,<--8
19,79,1279,5119,20479,81919,1310719,<--9
[COLOR="Red"]43,[/COLOR]<--10
[COLOR="red"]11,23,47,191,383,6143,786431,[/COLOR]<--11
[COLOR="Red"]103,1663,109051903,[/COLOR]<--12
13,223,3583,917503,14680063,<--13
[COLOR="red"]29,59,239,479,15359,245759,1966079,[/COLOR]<--14
31,127,8191,131071,524287,<--15
[COLOR="red"]67,271,1087,1114111,17825791,[/COLOR]<--16
17,71,1151,73727,294911,18874367,<--17
37,151,607,39845887,<--18
19,79,1279,5119,20479,81919,1310719,<--19
[COLOR="red"]41,83,167,2687,21503,172031,5505023,[/COLOR]<--20
[COLOR="red"]43,[/COLOR]<--[COLOR="DarkOrange"]21[/COLOR]
[COLOR="Red"]367,1471,94207[/COLOR],<--22
[COLOR="Red"]23,47,191,383,6143,786431,[/COLOR]<--[COLOR="DarkOrange"]23[/COLOR]
[COLOR="Red"]199,12799,51199,3276799,209715199,[/COLOR]<--24
[COLOR="red"]103,1663,109051903,[/COLOR]<--[COLOR="DarkOrange"]25[/COLOR]
53,107,431,863,6911,27647,442367,<--26
[COLOR="red"]223,3583,917503,14680063,[/COLOR]<--27
[/CODE]