I really don't understand why the FFT multiplication is faster. I'm not really sure if someone can explain the why... but many web pages DO explain the how......
Posted by: "sopadeajo2001" ... You've probably got messed up partition sizes, or your home directory is in a very strange place. I find it hard to imagine...
Congrats to "Ben Maloney / Five or Bust" for a truly huge PRP: http://tinyurl.com/lcaxcg 2^4583176+2131 1379674 Ben Maloney / Five or Bust 09/2009 David...
... You still have the right to a graphical shortcut if you want it though! It's your machine, you should be able to use it in the way that's most comfortable...
... I know nothing about the Ubuntu window manager(s), so I can't help you. Like many who've been using linux since 1993, I'm happiest in text terminals, and...
The strange cas of the divisibility by 17^2 of f(n), the product of 6 consecutive integers minus one Every n=3 mod 19 or 11 mod 19 f(n) is divisible by 19 ...
... I see no factor there. ... I see no factor there either. ... That's part of the "problem". I can't be bothered to implement a proper sieve that only...
If you can factor any factorization of n-1 that is greater than (n-1)^1/2, then you can use Pocklington's Theorem. ... From: primeform@yahoogroups.com...
I have an undergraduate student interested in a project, so I suggested looking into expanding the nth prime page http://primes.utm.edu/nthprime/ for the...
HI You have to use the GMP library, in C language.It's very fast, for primality test too.Giovanni Di Maria ... Da: sopadeajo2001 <sopadeajo2001@...> ...
Ho Do you know what method use the program PFGW? Is good then "window method" for exponentation, instead of "square & multiply" ? Than you for your answer. ...
Hi i have tested the primality of 31838235*2^29717+1 Why PFGW takes 3 seconds and GMP function probab_prime_p takes 34 seconds? Why pfgw if FASTER than gmp? ...
This is a question for anybody but i am thinking in Jens or David The "forprime"; in Pari gp stops near 2^32.Continuing the search for multiple-chains of primes...
Bouris Conjecture: if Q= k*2^n +1, and 'k' <= 2^n +1 is odd, and 'n' is an odd prime number, then 'Q' will NEVER test pseudo-prime under the following:...
I sent yesterday a prime curios to Honecker (hosted by Cadwell) about the small prime 151. This is what i said though i did not keep a copy: Smallest prime...
For people planning to do multiply-threaded runs of PFGW on the latest processors, I thought some timings may be of interest. The times are in seconds, for a...
The strange case of non-commutativity of for loops in Pari gp I am looking for 8 in a row consecutive primes product of 6 consecutive integers minus one. After...
I want to implement a search for numbers which must be 4 mod 19 or 12,13,14 or 15 mod 19 using a forstep loop with Pari gp. forstep(X=a,b,s,seq): the sequence...
I send this mail to trnicely : I found a record GAP of 351526 with a merit of 19.1 , the first prime of this GAP is 15889*18481#/6-197044 , all the odd numbers...
You can d/l Windows, MacIntel, and Linux versions from these links: http://openpfgw.svn.sourceforge.net/viewvc/openpfgw/pfgw_win_3.2_20090725.zip?view=log ...
I have posted the latest Windows and MacIntel distributions at this link: http://openpfgw.svn.sourceforge.net/viewvc/openpfgw/pfgw_win_3.1_20090708.zip ...
Hello Group! Just two months after improving the CC10 record I discovered the following CC10 which is another 10 digits larger: 1070828503293*2^(k-1)*239#+1,...
Hello, I tried looking at classes of numbers that I believe would be pseudo-prime free when tested against the base that makes up each different class of...
Does anyone use PFGW server, which is bundled with PFGW? I would like to eventually obsolete this application. I think that I can get PRPNet to do most of...
Please download them and (try to) find test cases that fail. What's new since last pre-alpha 3.0 release. 1) Statically linked with C runtime library so that...
... My computer works without errors. No crash. PC: Phenom X4, WIN XP 32bit BWT, nice version ! PRPing for normal numbers is 3% faster and for special numbers...
