Mersenne: Q:GIMPS freezes my system

Hi there, I've experienced a problem. I'm wondering if anyone else has had this problem: GIMPS freezes my system after it runs for about 24 hours or so. I have Windows NT 4.0 (SP5) Dual Intel Celeron 433Mhz (BP6 motherboard) 128MB RAM If I quit both GIMPS processes on my machine (and I'm

Re: Mersenne: Q:GIMPS freezes my system

On Mon, 24 Jan 2000, Dennis Peter wrote: Hi there, I've experienced a problem. I'm wondering if anyone else has had this problem: GIMPS freezes my system after it runs for about 24 hours or so. I have Windows NT 4.0 (SP5) Dual Intel Celeron 433Mhz (BP6 motherboard) 128MB RAM Hi

Re: Mersenne: Size of largest prime factor

Pierre Abbat wrote: If I pick a huge number n at random, how much smaller than n, on average, is its largest prime factor? Jud McCranie wrote:- On the average, the largest prime factor of n is n^0.6065, and the second largest is n^0.2117. Reference: Knuth, the Art of Computer

Re: Mersenne: Q:GIMPS freezes my system

Kel, I have run other numerous programs (including other number crunching spare CPU-cycle programs) and my system has never froze until I ran Prime95.exe. I installed GIMPS 7 days ago. I've had my system for about a year or so. I'll check out bp6.com... and yes, I know that the dual-celeron

Re: Mersenne: Size of largest prime factor

On Mon, 24 Jan 2000, Paul Landon wrote: Subject: Re: Mersenne: Size of largest prime factor Pierre Abbat wrote: If I pick a huge number n at random, how much smaller than n, on average, is its largest prime factor? Jud McCranie wrote:- On the average, the largest prime factor of

Re: Mersenne: Size of largest prime factor

Hiya Henrik, I did mean for 2^p-1; p prime. That's why I work in Computing not the discipline of Maths :-) I am certain that the graph in Knuth sect 4.5.4 (which by luck I had only read for the first time last night) is definately not applicable to Mersenne numbers (with prime exponent). I am

Re: Mersenne: Size of largest prime factor

At 11:48 AM 1/24/00 +0100, Paul Landon wrote: On the average, the largest prime factor of n is n^0.6065, But for Mersennes this might not be the case. For the size of exponents that we deal with Mersennes are less composite than a random set of ones zeroes. That's right, but the original

Mersenne: Re : Odd's on finding a factor

Dave Mullen wrote: >Sorry, I'm no mathematician, and new to the Mersenne field. > >> No, in the x-y bit range (remember that n bit integers are >> about >2^n) the first factor could be x/2 to y/2 bits long >> (powers of a power >multiply). > >What I was trying to say in my disjointed way was

Re: Mersenne: Size of largest prime factor

On 24 Jan 00, at 11:48, Paul Landon wrote: This is not new news to most people here, but I have to remind myself, it still hasn't been proved whether there are an infinite number of Mersenne Primes or an infinite number of Mersenne composites. The latter conjecture looks very, very

Re: Mersenne: Re : Odd's on finding a factor (part 2)

Thus for the exponent 1165 bits long, if it only has 2 factors , then the first factor must be between 2 and 3413 bits long, and the second factor must be between 3413 and 1164 bits long. Note that the bit lengths of the 2 factors added together must equal the bit length of the Prime

Re: Mersenne: Q:GIMPS freezes my system

Hi there, I've experienced a problem. I'm wondering if anyone else has had this problem: GIMPS freezes my system after it runs for about 24 hours or so. I have Windows NT 4.0 (SP5) Dual Intel Celeron 433Mhz (BP6 motherboard) 128MB RAM If I quit both GIMPS processes on my machine

Mersenne: Round off error = 0.5

Hi all, I'm running Prime95 on a PII-400 for 6 days (no overclocking) at exponent 9409271. It's produced several outputs concerning ROUND OFF ERRORS - the last one is ROUND OFF [0.5] 0.4 What to do now? Restart from iteration 1? Regards Dieter Schmitt

Re: Mersenne: Round off error = 0.5

Hi, At 01:04 AM 1/25/00 +0100, Dieter Schmitt wrote: I'm running Prime95 on a PII-400 for 6 days (no overclocking) at exponent 9409271. It's produced several outputs concerning ROUND OFF ERRORS - the last one is ROUND OFF [0.5] 0.4 What to do now? Restart from iteration 1? The first thing

Mersenne: Red Red Red

Aaaack! Who's the one sending mail to the list that makes it appear with a red background? Stephan "Retinal Afterimage" Lavavej _ Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm Mersenne Prime FAQ --

Mersenne: Re: Odd's on finding a factor (part 2)

Dave Mullin wrote: Result = MODPOW(2,MersenneExponent,TrialFactor) where TrialFactor is the MersenneExponent * 2 * (some k in range 1 to 2^16) + 1. If Result = 1 then TrialFactor divides the Mersenne Prime. As UBASIC can handle around 2600 decimal digits, in theory (and with a lot of time), I

Re: Mersenne: Odds on finding a factor ?

- Original Message - From: Lucas Wiman [EMAIL PROTECTED] I think under windows that dos windows only run when they are "up". (I could be wrong, I've stopped using windows again) No. You can set a background priority. In Win 95, right-click on the icon, then click "Properties". Click

Mersenne: Re: Odds on finding a factor

There only a slight error with your logic... For the exponent1165, the root is *not* 3413 bits long, but more like 5825000bits long. Perhaps you forgot exponents add, not multiply. Okay, next time I'll open my mouth a little wider, so I can fit both feet inside. Sorry all, sometimes

Re: Mersenne: Re: Odds on finding a factor

Who needs to? I have code which tries any number up to 2^95 as a factor of a Mersenne number with an exponent up to approx. 600 million, using less than 1 KByte of code space and 32 bytes of data storage. It executes in a time proportional to the logarithm of the exponent - for an

Mersenne Digest V1 #683

Mersenne DigestSunday, January 23 2000Volume 01 : Number 683 -- Date: Sat, 22 Jan 2000 11:35:38 -0800 From: Gerry Snyder [EMAIL PROTECTED] Subject: Mersenne: Best chance to make a "real" contribution?