... PS: I also noted that in Musatov's beta-minus effort http://www.newmedici.com/2009/01/31/primediscovery/ for SCRW 313 Beginning Screenwriting Raphael...
I do love that scene from "Good Will hunting". http://www.newmedici.com/2009/01/31/primediscovery/ Now, he is sending me email. Let me put it this way Musatov:...
... A neat riposte, Shane. Yet in the case of Musatov's bathetically incompetent frauds there must be several hundred folk listed at the Prime Pages alone who...
Hello, I'm shure these are known that 2^173242173089-1 have factor 8315624308273, 2^672937259-1 have factor 1391474092544359, 2^201881177-1 have factor...
Well done. Is it easy to detect result iterations like that of LLR? If not, then can you detect LLR's last write changes to it's result file? To be practical...
Hi,I have been looking at primes that are the evaluation of polynomialswith sequential prime coefficients which I call primenomials. For example f(x) = 7x^3 +...
... Call this script file "pfgw.txt" : SCRIPT DIM n1,13409 DIM n2,10^6 DIM mm,257 DIM xx DIM ii DIM yy DIM tt DIMS st SET xx,n1 LABEL loopx SET ii,1 SET yy,2 ...
... ******************** Joke about I read on the 8 new M..., congrats for David and others I d'nt found 8 new Mersenne primes but more than 2,000 of near...
... We better add that j > 1, else the problem is trivial :-) ... No, Pierre. The sum of those two ratios must diverge at large n, according to the prime...
... ********************************************************* I d'nt claim what you write , I just say that for large n let say n=10^1000000 the sum j+k may be...
... Indeed. That is why I spoke of probabilities. Consider n in a range from N to N+M where M is huge, but N is enormously *huger* than M. (Neither of us has...
... I did record this cumulative data set, ... ********************************************* The problem now is that we d'nt have the same results Here the...
... The 1500 primes on which my table was based are in http://physics.open.ac.uk/~dbroadhu/cert/pcs.in where the ABC format uses the order k, j, n. Amitiés ...
... Ah, I did make a mistake, sorry! But it was in compling my third column, where I meant to divide by S2(N) = S1(N)*sqrt(log(N)) [David's suggested trend] ...
... ************************************************************ Again you help me a lot and I thank you very much Now I just need to know if I well understand...
... Yes, I think that it ought to better than what you had. Here is my simplest "handwaving" argument (not a proof) for the factor of sqrt(log(N)). Previously...
... ******************************************************************* I hope that in a few days I will get all this in mind but not sure ! You remember me...
... random? ... Indeed many folks are. The pattern the primes have modulo six must be the most rediscovered prime pattern of the last 2,000 years. So once ...
... be ... once ... A crucial distinction between the fact that all Primes are of the form +/-6, and the fact that the gaps between the Primes which are (mod6)...
Statistics on Pierre Cami's Riesel-hypotenuse (RH) primes I report a statistical study of primes, with the Riesel form k*j^n - 1, for j > 1, k > 0, 3001 > n >...
Nice find. Out of curiosity are you doing this as part of a project or are you doing it as part of some other search of your own? ... [Non-text portions of...
... *************************************** Bravo David for you nice work I remark that curiously 0.5*sqrt(log(3))= 0.524 not so far may be from the limit And...
... Neither, Mark. I was trying to honour a previous well-meant compliment to you, that you might recall :-) Also it was good to create a 44th provers' code at...
... Apologies for the bad typo, where the last "N" should be "n". ... I have no idea whatsoever of how to derive ~ 0.53, if indeed it is close to an...
... I appreciate the compliment. Thank you. 44 prover codes!!! You certainly do get around, don't you. Although x18, x20, x21 and x43 don't include any...
As we've been discussing this a little, I wonder if the following would make sense when creating a new prover code. I suggest breaking down the software into...