A probable CPAP-3 with 10042 digits: 19067408*2^33333-12539 + 6270*n, for n = 0, 1, 2 n=0 and n=1 give probable primes. 19067408*2^33333+1 for n=2 is a proven...
... [snip] ... Since ECPP is readily parallelizable it would be great if Francois Morain would release a single-PC multi-core (64-bit) version of fastECPP for...
... The record held. There wasn't even a non-consecutive AP-3 in the rest. The search gave 1492 gigantic prp's in total. A double hit was expected 1 in 586...
... (Projects) PrimeGrid and TwinPrime Search are showing some ~2k n=333333 primes between them -- about 60% of the number needed to give them a ~60% chance of...
Hello, for example with PFGW , use after PRPing "pfgw -tc filewithprps" regards Norman ... __________________________________ Alles was der Gesundheit und...
Hi, Group; and Paul Underwood. '2nd-kind' Proth number classification (as described by me); this number won't generate psuedoprimes when tested base two. ...
... see: http://primes.utm.edu/glossary/page.php?sort=StrongPRP and: http://mathworld.wolfram.com/Iff.html You did not use "12.4999... % of the number of...
Hi all, Third time lucky 2^5900 + 469721931951 2^5900 + 469721934831 2^5900 + 469721937711 2^5900 + 469721940591 form a CPAP4 each with 1777 digits and...
Hi All! I actually try to find the most suitable journal to publish a paper intitulated: "Toward a ultimated and unified theory of factorization of Cunningham...
... Virtually no journal will publish a conjecture alone. Usually conjectures are buried in the midst of theorems and proofs, or shared in informal ways. CC...
Thank for your answer Chris, but unfortunately it doesn't help me. I have a lot of material (a small set of conjectures all based on a basic one). As I said my...
Posted by: "Sean A. Irvine" ... Erm, that's trivial. The first divides 2^4770873414614514823726411765367314130342678121207508100045009-1 Phil () ASCII ribbon...
Hi Sean, Right now it's difficult to say (probably not) if my conjectures could speed up the search of factors of Cunningham numbers, but who knows? I think my...
Hello group, today, I found a new (possible) triplet with 6223 digits (>20000 bits). Primo v2.2.0_b7 is running. After very long time I found this: ...
Thank you,Jens! A question to you: What is the running time for a 6.2k digit number ? My calculation is 3 or 4 months on a 2.133 Ghz Athlon MP. After 3 days I...
I was wondering how the conversion was done. From a regular 2357207 digit number to 28433·2^7830457+1. I am thinking it is called Scientific notation but i...
... The number is written 28433*2^7830457+1 in ASCII and it is the 9th largest known prime: http://primes.utm.edu/primes/page.php?id=73145 * and + are normal...
Hi, Group. this program won't run when compiled as $scriptify.pl <bouris.pcs> bouris.scr ...am I missing something ??? SCRIPT // DIM L,3; DIM M,2^3; DIM...
I think I have fixed it. The comments explain what I did. NOTE the output is: Script File L=3,N=1 L=3,N=3 COMPOSITE COMPOSITE Is that what you expected? Jim....
Thanks, Jim... the output is correct. I wouldn't have got it without your help; my syntax was horrible. ... the ... alone ... formatting. ... outside ... ...
// Jim, alas... int iL=3; int M=2^3; int Z1; int Z2; int Z3; int Z4; int Z5; int Z6; int Z7; int Z8; for(N=1;N<=M;N+=2){ Z1=M*(M+N)+1; Z2=(((Z1-3)/2-1)/2-1)/2;...
Hi All. I've been using primeform for awhile and though I would see if there was a newer version and stumbled upon PFGW. I was curious to see how well it...
A lot more info is good for comparisons. Which primeform version? Which PFGW version? Which cpu? Were they running at normal cpu priority with no other cpu...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
