Mersenne: Prime95 causes screen jitters

2000-02-06 Thread Russel Brooks
I've got my friend's 450MHz PII Aptiva with 256Meg ram running Prime95 under Win98. I'm seeing minor interference on the display when Prime is running. If I stop Prime the interference stops. Not much else is running 99% of the time so it's an ideal GIMPS machine but I'm bothered by the affect

Re: Mersenne: SMP GIMPSing And Sharing The Burden

2000-02-06 Thread Brian J. Beesley
On 6 Feb 00, at 12:50, Jason Stratos Papadopoulos wrote: > > > However, the FFT itself is very amenable to parallel processing > > > techniques - on a processor with N independent compute pathways, you > > > can compute N elements in the same time that a single element would > > > take to compute

Mersenne: Re: 60 Day Expiration

2000-02-06 Thread Steinar H. Gunderson
On Sun, Feb 06, 2000 at 05:37:58AM -0600, Mikus Grinbergs wrote: >I've mothballed a middling-speed non-Intel machine. That machine >could have been participating in GIMPS, but I chose not to have >it do so any more. The reason - I resent feeling "pressured" by >expiration requirements and contac

Mersenne: Does GIMPS send e-mails to the originator?

2000-02-06 Thread Joth Tupper
this is a test. again, sorry for the spam. _ Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers

Re: Mersenne: SMP GIMPSing And Sharing The Burden

2000-02-06 Thread Jason Stratos Papadopoulos
On Sun, 6 Feb 2000, Lars Lindley wrote: > > However, the FFT itself is very amenable to parallel processing > > techniques - on a processor with N independent compute pathways, you > > can compute N elements in the same time that a single element would > > take to compute just one. > > > How much

RE: Mersenne: SMP GIMPSing And Sharing The Burden

2000-02-06 Thread Aaron Blosser
> > However, the FFT itself is very amenable to parallel processing > > techniques - on a processor with N independent compute pathways, you > > can compute N elements in the same time that a single element would > > take to compute just one. > > > How much of the mersenne-test is used for the FFT

Re: Mersenne: SMP GIMPSing And Sharing The Burden

2000-02-06 Thread Lars Lindley
- Original Message - From: Brian J. Beesley <[EMAIL PROTECTED]> > However, the FFT itself is very amenable to parallel processing > techniques - on a processor with N independent compute pathways, you > can compute N elements in the same time that a single element would > take to compute

RE: Mersenne: Re: The return of poaching

2000-02-06 Thread Geoffrey Faivre-Malloy
> I'm an impatient person in a way. I like my exponents finished in a few Me too :) That's why I factor. I've got about 8 machines factoring (from PII 266 all the way up to PIII 500). Still...someone has managed to push me down to number 4 on the factoring top 100. I'll catch up though! :)

Mersenne: 60 Day Expiration

2000-02-06 Thread Mikus Grinbergs
I've mothballed a middling-speed non-Intel machine. That machine could have been participating in GIMPS, but I chose not to have it do so any more. The reason - I resent feeling "pressured" by expiration requirements and contact-every-xx-days requirements. That machine is not normally connecte

Mersenne: Re: The return of poaching

2000-02-06 Thread Wojciech Florek
Hi all! My 2 cents... > > few are hogging all those exponents for themselves, purely for the > > satisfaction of watching their stats go up on a day by day basis. > > > > Did you know that for about 6-8 hours _each_ days, it's only expired > exponent that are distributed. So about 20 exponent re-

RE: Mersenne: P-1 factoring

2000-02-06 Thread Paul Leyland
> I've been reading up on the P-1 method ... am I missing something? I don't think so, except perhaps for on possibility... > > For a Mersenne number 2^n-1 with n prime we know that all the factors > are of the form 2kn+1 for some integer k. So the factorization of p-1 > _must_ include at le

Mersenne: P-1 factoring

2000-02-06 Thread Brian J. Beesley
I've been reading up on the P-1 method ... am I missing something? For a Mersenne number 2^n-1 with n prime we know that all the factors are of the form 2kn+1 for some integer k. So the factorization of p-1 _must_ include at least one factor equal to n. But the text leads me to believe that th

Re: Mersenne: SMP GIMPSing And Sharing The Burden

2000-02-06 Thread Brian J. Beesley
On 2 Feb 00, at 20:15, Stefan Struiker wrote: > Does the L-L process lend itself to some parallelization > (not the running of multiple copies) over N processors? Not very well. However, the FFT itself is very amenable to parallel processing techniques - on a processor with N independent compu

Mersenne Digest V1 #688

2000-02-06 Thread Mersenne Digest
Mersenne DigestSunday, February 6 2000Volume 01 : Number 688 -- Date: Fri, 4 Feb 2000 12:33:07 -0600 From: Jeremy Blosser <[EMAIL PROTECTED]> Subject: RE: Mersenne: FW: what do you think about the authentici

Re: Mersenne: The return of poaching?

2000-02-06 Thread Brian J. Beesley
No particular quotes - lots have people have had interesting and relevant things to say. 1) I have no problem with the likes of David Campeau (aka diamonddave) as, whatever systems he is using, the exponents seem to get cleared in a reasonable time (_much_ faster than the reports indicate) -