Hi, Group. this program won't run when compiled as $scriptify.pl <bouris.pcs> bouris.scr ...am I missing something ??? SCRIPT // DIM L,3; DIM M,2^3; DIM...
I think I have fixed it. The comments explain what I did. NOTE the output is: Script File L=3,N=1 L=3,N=3 COMPOSITE COMPOSITE Is that what you expected? Jim....
Thanks, Jim... the output is correct. I wouldn't have got it without your help; my syntax was horrible. ... the ... alone ... formatting. ... outside ... ...
// Jim, alas... int iL=3; int M=2^3; int Z1; int Z2; int Z3; int Z4; int Z5; int Z6; int Z7; int Z8; for(N=1;N<=M;N+=2){ Z1=M*(M+N)+1; Z2=(((Z1-3)/2-1)/2-1)/2;...
Hi All. I've been using primeform for awhile and though I would see if there was a newer version and stumbled upon PFGW. I was curious to see how well it...
A lot more info is good for comparisons. Which primeform version? Which PFGW version? Which cpu? Were they running at normal cpu priority with no other cpu...
I created this file: ABC2 (10^$a-1)/11 a: from 1 to 2500 and ran it using the command: pfgw -f test.in > stdout.io 2> stderr.io This finished in about .5s on...
... Primeform verision 0.4 PFGW is the current version on the main page. CPU is a P4 2.8G and I had all other jobs shut down while running the test. ... ...
... Couldn't it be caused by the processor being dualcore / hyperthreading / appearing as two separate CPUs from the OS point of view for some other reason? If...
If I may share my experience. Using multiple CPUs... CPU0 does not get the OS load placed on it, CPU1 does. So CPU0 is 100% free to run the heavy jobs. The...
... You must have a dual core CPU. If so, PFGW (and or primeform), will only use at most 1/2 of the CPU. On many of the "better" dual core systems, you can...
Just an update: I reran the test using (10^(2*$a+1)+1)/11 with a from 1 to 1250. (The minus one in first post was a typo.) Primeform took 4:20 while PFGW ...
... Make two DOS windows, each running PFGW from a different folder, the first with exponent (2*$a+1) and the other with (2*$a+3) stepping $a by 2 in each ...
I reran the test using (10^(2*$a+1)+1)/11 with a from 1 to 1250. (The ... Make two DOS windows, each running PFGW from a different folder, the first with...
David, I have found this prime MYSELF after reserving a MANUAL range over @ mersenneforum.org.(http://mersenneforum.org/showthread.php?t=8137) Outside of the...
Hello, I have make same GCD per hand and found this. Take a n where a^n=a mod n , is n now a true prime ? I searched for small factor of n-1. k is factor of...
The following result 809504830479349+208*19#*n, n=0...20 (Pawel Nowak, Jaroslaw Wroblewski, December 31, 2007) improves the AP21 minimal difference (2681*19#)...
... I patched the hole with the "Lucas V" method by insisting on a Euler probable prime test: 5^((n-1)/2)=jacobi(5,n). Both the above "counterexamples" happen...
Hi, Re: David's http://tech.groups.yahoo.com/group/primeform/message/7338 firstly, some local notation: "+-" and "-+" is used throughout in a conjunctively...
The university I work at has a few big clusters of computers that I've been given permission to run prime programs (mainly llr, but also pfgw) on, and they are...
hi Joe, The videocard manufacturers are competing with each other. If company A says they can do 1 teraflop a second, then company B will say they can do 1...
I don't have much information about the price as I'm not the one buying it. I'll have to get back to you on just how much better computing works on the card....
I wouldn't say it like that Joe, It certainly isn't easy to get a good FFT going in 32 bits. It is very well possible that if your FFT is 1 GB huge and just...
Of course Joe, i posted a lowerbound. In reality there is the overhead of FFT which is for DWT like 4n + 2n log n Fact is that if the internal cache subsystem...
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.
