Hello group ! The new URL is http://anthony.d.forbes.googlepages.com/ktuplets.htm regards Norman Wissenswertes für Bastler und Hobby Handwerker. BE A BETTER...
Congrats to Jens for http://primes.utm.edu/primes/page.php?id=82059 David PS: Chris will need to add Jens's comments to complete the recording of the AP3....
Let m=67440294559676054016000 y=(m*(10^96+10624986)+22)^2 N=(y-11^4)*(y-35^2)*(y-47^2)*(y-94^2)*(y-146^2)*(y-148^2)/m-4 then N+k is factorized for k in [0,6]. ...
The new version of RMA.NET, has been extensively tested, and is now ready for release. This windows program is by far the fastest prime number software ...
OK, so I've been unsuccessfully trying to solve Jack Brennen's problem of finding 6 consecutive fully factored titanic integers. Turns out that (as usual) Jens...
PG+TPS have found 1588 single primes of size slightly greater than 2^(10^6/3). I guess that most of their twin candidates were sieved to depths between 2P and...
Congrats to Primegrid and, in particular, to Lasse Mejling Andersen for a 2 megabit Woodall prime: http://primes.utm.edu/top20/page.php?id=7 now being tested ...
I have a question to ask. As you all know repunits are defined as (10^n-1)/9. With tests available it's possible to test for prp but not for proven primality....
Hi, Group-Moderator. Is there a newer pfgw program on the way??? If so, what might be some its new features??? Or could you point me to an article that might...
RMA.NET is now available for beta testing on Windows Vista. The source files are located here: http://tech.groups.yahoo.com/group/15kSearch/ The direct link to...
... ( found on my 120MHz laptop ) reveals that the top5000 primes have more than 60 thousand digits. Congratulations to all the people who have achieved this...
When pfgw says "XXXX is 3-PRP!", does that mean that the number has passed a Fermat test to base 3 or a strong probable primality test to that base? The...
Congrats to projects Twin Prime Search and PrimeGrid for attaining 1000 primes between them (with a few pending submission verifications.) I have not seen this...
1467763*2^1467763-1 with 441847 digits: http://primes.utm.edu/primes/page.php?id=80955 Big congratulations to Zsuzsi Mate (first Prime Pages entry), Willem...
Here's something a bit different. (It can't be new, but I've not seen anything about it, so it seemed worth communicating.) The complex numbers have a...
N = primV(40395,-1,15588) is a 47759-digit prime. The proof relies on the following happy circumstances. 1) Since 15588 = 6^2*433, there are numdiv(12*432) +...
Does anyone know of a project to find primes of the form p(n)=3^n-2? Is this type being actively worked on? They are not mentioned in the Proth Search pages....
Hi, by "Search by form" (2^n+1)^4-2 on http://www.primenumbers.net/prptop/prptop.php these PRPs are given: 7 (2^148330+1)^4-2 178608 Cletus Emmanuel 12/2003 ...
Why is ((2^55373+1606)*(2^55373)+1) prime w/only a -b2 test??? Here's my best proof for it--- '2nd-kind' Proth number. Bouris-Proth Theorem: Let Q= k*2^n+1,...
Hi, I would like to find twin primes near 10^n with PFGW. I can program sequence A124001 in Pari like this: for(n=1,30,k=1;while(!isprime(10^n+k) || !isprime ...
Hello, Group. for reference... Proth number(1878): p= k*(2^n)+1, k odd < 2^n, why is k odd ??? for some a... p is prime iff a^((p-1)/2)== -1 (mod p). my...
Hi, Group. I created the idea of a '2nd-kind' proth using the orginal definition of a Proth number. It's interesting that z= ((2^3011)*(2^3011+2*948)+1). Proth...
Let x = (475+sqrt(475^2+4))/2. Then the generalized Lucas number N = U(475,-1,5039) = (x^5039 + 1/x^5039)/(x + 1/x) is a 13486-digit prime. The proof was...
