Congrats to Eric Embling and PrimeGrid for http://primes.utm.edu/primes/page.php?id=87401 I am bound to say: PrimeGrid does seems to be very well organized,...
I read to see if there's a clause in the preamble of this prime group and there isn't, so... I corrected this gold- bach proof the way that Mr. Broadhurst...
don't get mad... like someone else did. why search endlessly for an example... when you can disprove it! just use a pencil and paper to follow the algegra;...
I finally got the typos out of it... Sebastian would be proud. whatever is done the LHS must be done to RHS of the equation. (a comment from Mr. David...
I don't even have to acknowledge the true definition of what phi() really is to show you that SMR makes perfect sense, phi(n^2 -k^2) =(n-1)^2 -k^2 just has to...
... With n = 22 and k = 20 we have phi(n^2 - k^2) + 2*k - 1 > (n-1)^2 - k^2 as we are told to "suppose", yet phi(phi(n^2 - k^2) + 2*k -1) < phi((n-1)^2 - k^2) ...
Define 2*n=M with 10^14<n<10^15 Define p prime>2 and 10^7<p<10^8 By the Prime Number Theorem M-p has 1/log(2*n) chance to be prime q ( or I miss something ? ) ...
... I will assume you are attempting a heuristic estimate, not a proof--because there is no proof up this alley. You missed that M is even, so <-p is most...
... Did you know if there is a conjecture such that one ? for n even > 4209 there is at least one pair of primes p,q such that n=p+q with p+2 or p-2 twin of p...
A PFGW pseudoprimality test to base b is often good enough as a first stage in selecting probable primes, and is at least 6 times as fast as pari-GP's...
... pfgw -b# just makes a Fermat #-prp test like this in pari-GP: Fermatbprp(n,b)=Mod(b,n)^(n-1)==1 Is that all you want? ispseudoprime() starts with trial...
Presumably one has to use the same base for the results to match - are the defaults for each of the two programs the same? [I imagine you/we've thought of...
I forgot, but did you state what hardware you are running on? Does the 0.68 build from this thread, http://www.mersenneforum.org/showthread.php?t=11264 return...
... but the executable 256163 Mar 1 13:13 phrot.p3* does not work, this end: $ phrot.p3 -q"4567*68^12356-1" .//phrot.p3: .//phrot.p3: cannot execute binary...
... Geoff's executable at http://www.geocities.com/g_w_reynolds/phrot/ kicked in just fine: $ phrot.p3-linux.static -e -o -q"2*3^405504-1" Phil Carmody's Phrot...
... Geoff's linux executable of phrot 0.68 gave 2*3^405504-1 is composite LLR64=30a6f5fbfd3ff603. (e=0.00323 (0.00443864~5.36885e-16@...) t=2997.18s) while...
I wonder if the difference here is AMD. I don't know if Geoff built his version of phrot on AMD or Intel. Would you be able to build your own copy on AMD and...
Sorry, but my previous response didn't go to the list. phrot is not used by BOINC, but it is used by PrimeGrid (via PRPNet). AFAIK, the servers are set up to...