... Thanks! ... Once you have a GP version of CHGFac(n,s,r), try something like {tst(al,digs)=local(n,r,s,x,f,g); s=137+random(10^(ceil(digs*al))); ...
Hello Group I would like to formally submit to the group for your consideration, a number of Conjectures and Theorems relating to Prime Numbers. Theorem....
\\ First stab at CHG.gp : inelegant; inefficient; buggy. \\ But at least it did work on 4 small tests :-) \\ Greg and Phil: Can we clean and tighten it up? \\...
John, Congratulations on the factorizations that you posted in http://groups.yahoo.com/group/primeform/files/LucasFib/ jrenzefactors1.txt jrenzefactors1.txt ...
... I'm the one who encouraged you to post your results here so I will answer. Sorry, but you have found nothing new or non-trivial to mathematicians. ... ...
... Sorry, I formulated that wrong. I meant that there does not exist a constant c such that: There is always a prime at most c greater than a (given) multiple...
Hi, I uploaded my Mma->Pari conversion of the routine. It's CHG.GP in the LucasFib directory. Note that I did steal the polynomial factoring bit from...
A verification of fibonacci(37511) required 2000 digit precision, took 28 minutes, 16 seconds to complete on a 1.9GHz Opteron, and of course found no factors. ...
Hello, This email message is a notification to let you know that a file has been uploaded to the Files area of the primeform group. File : /RMA.exe ...
primeform@yahoogroups...
Dec 2, 2004 10:34 am
5094
... since GP is merely 50 times faster than Mma, at first bash. David :-)...
Greg, As you probably realized, the need for numerical precision is ilusory. GP asks for it to compute X=floor(n^gamma), but as gamma need only satisy the...
The 50-fold speedup is very impressive. I must say I was not expecting anything quite so dramatic. As Mathematica also uses GMP (starting with Version 5.0),...
I am willing to consider this to now to be the "official" version, both because of the speed-up and the fact it is now in the preferred languague of this...
... That was actually my original implementation, and I have that written. It was really just a matter of stealing it from David again since it's in his KP...
... How does that square with the GNU Lesser General Public Licence? http://www.gnu.org/copyleft/lesser.html#SEC1 referred to in http://www.swox.com/gmp/ ... ...
Proposal: This group works together to produce a doubly-certificated proof of the primality of Lucas(44507) with 9302 digits and N-1 at 10.81% N+1 at 17.65% ...
... Just let me know what blurb you want to add to the Bio when we're done. What is the client program. I am heavily tied up with 3*2^n-1 for the foreseeable...
I'm in. By certificate I assume you mean the polynomial for each interval, no? Should I produce these certificates for F37511 as well and put them somewhere...
Draft proposal for a CHG primality certificate: A CHG certificate shall consist of: The easy bits: 1) Factor files for N-1 and N+1; 2) Primality proofs for...
When we have an agreed form of Certificate and Validator, larger targets may be tackled on a client-server basis, if desired, since the mathematical necessity...
... The first element of the reduced basis (or equivalently, the final polynomial) is enough. As long as this vector satisfies the condition ... it is a...
Wait a minute, I see your point now. We have to be able to verify that the short vector we get did actually come out of a valid LLL operation. So you are...
Hi all, ... Apparently, this version was built with to dynamically link with the Microsoft Visual C Run Time (debug) DLL. I don't know if Jim intended it to...
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.
