Re: Mersenne: Prime 95 Error Messages/ Misc

1999-06-08 Thread Gary Diehl
The system I built/overclocked is a Pentium-II 266 with a Shuttle Computer International HOT-641 motherboard and 256 megs of 10ns RAM. The original bus clock speed was 66 mhz which I upped to 83 mhz in the BIOS Configuration Utility. I had to remove the case and train a 3" desk fan on the CPU to

RE: Mersenne: Prime 95 Error Messages/ Misc

1999-06-08 Thread Ethan Hansen
Aaron, You are correct in identifying overheating as the main problem. Most major manufactures give a maximum air temperature of 35-40C inside the PC case. If the air temperature is lower, the processor will run somewhat faster. The speedup is on the order of 1-3MHz per degree C, depending

Mersenne: re: Island Theory...Settled?

1999-06-08 Thread Griffith, Shaun
Luke Welsh writes: TTBOMK, the theory was never formalized. Regardless, Peter Lawrence Montgomery settled the issue: http://www2.netdoor.com/~acurry/mersenne/archive2/0032.html I assume that the island theory was settled in the negative? I have read the post, and others. Instead of

Re: Mersenne: Re: [First 10 million digit exponent]

1999-06-08 Thread bjb
> > And below M3600, there are 159,975 exponents (again repeating Brian) > > with at least 10 million digits. > > Fine, but are the efforts being made in that region centrally registered? Not to my knowledge - seems pointless since few programs currently available can cope with exponents in

Mersenne: These go to 11 (WAS: blahblah...)

1999-06-08 Thread Ernst W. Mayer
Paul Leyland <[EMAIL PROTECTED]> wrote: >The radix is always 10. {snip} >or, more concisely, (1+1+1)^(1+1) + 1. > >Can anyone represent that number in fewer than (1+1+1)! ones? How about 1 << 1, where the shift is, of course, decimal. Your shifty friend, -Ernst

Re: Mersenne: Re: Mersenne Digest V1 #569

1999-06-08 Thread George Woltman
At 09:10 AM 6/8/99 +0100, you wrote: >On Mon, Jun 07, 1999 at 04:37:32PM -0500, JON STRAYER wrote: >> > You need to test exponent (1000 / log 2) = 33219281 or above. > >Time for an n bit multiply using DWT is O(n log n) plus some fiddly >bits to do with decreasing precision available when usin

Mersenne: Re: Self-test (was: Prime 95 Error Messages/ Misc)

1999-06-08 Thread George Woltman
Hi, An aside: Please try to rename the subject like I did above when the thread has strayed way off the original topic). Thanks. At 06:34 AM 6/8/99 -0500, Mikus Grinbergs wrote: >I have seen opinions on this mailing list that the >existing 16-hour self-test might not be enough to bring

Re: Mersenne: Prime 95 Error Messages/ Misc

1999-06-08 Thread George Woltman
Hi, At 04:39 PM 6/7/99 -0700, J. Williams wrote: >Error: Illegal Sumout This error can be a hardware problem, but is very often caused by a faulty driver or program (usually related to the audio card). >Is this anything I need to be concerned about and is there a listing of >such messages? Thi

Re: Mersenne: Re: [First 10 million digit exponent]

1999-06-08 Thread Henk Stokhorst.
L.S., > And below M3600, there are 159,975 exponents (again repeating Brian) > with at least 10 million digits. Fine, but are the efforts being made in that region centrally registered? YotN, Henk Stokhorst. Unsubscribe & l

RE: Mersenne: Prime 95 Error Messages/ Misc

1999-06-08 Thread Aaron Blosser
> If you've overclocked your system at all (_not_ reccomended, but I > know it can be successful in some cases) then I suggest you let > the torture test run for a couple of days before committing yourself > to doing "real" work. It can happen that an overclocked system > appears to run fine for "

Re: Mersenne: Prime 95 Error Messages/ Misc

1999-06-08 Thread Mikus Grinbergs
Note to the QA testers: I personally do not overclock, but from time to time I do upgrade motherboards. I have seen opinions on this mailing list that the existing 16-hour self-test might not be enough to bring hardware deficiencies to light. Someone suggested running the torture test - but is

Mersenne Digest V1 #570

1999-06-08 Thread Mersenne Digest
Mersenne Digest Tuesday, June 8 1999 Volume 01 : Number 570 -- Date: Mon, 7 Jun 1999 11:01:43 +0200 From: "Steinar H. Gunderson" <[EMAIL PROTECTED]> Subject: Mersenne: Re: Mersenne Digest V1 #568 On Sat, Jun

Mersenne: Re: [First 10 million digit exponent]

1999-06-08 Thread Steinar H. Gunderson
On Tue, Jun 08, 1999 at 11:53:30AM +0200, Alex Kruppa wrote: >The math is really quite simple: a number n has log_10(n) (logarithm with base 10) >decimal digits or ld(n) (ld = log_2 = logarithm with base 2) bits. >You can do a base conversion between logarithms from base a to base b by >dividing l

Re: Mersenne: Re: Mersenne Digest V1 #569

1999-06-08 Thread Nick Craig-Wood
On Mon, Jun 07, 1999 at 04:37:32PM -0500, JON STRAYER wrote: > I'm I correct in thinking that since the exponent is five times the > size of current exponents that the LL test will take 25 times as > long (give the same processor)? > > > You need to test exponent (1000 / log 2) = 33219281 or

RE: Mersenne: Prime 95 Error Messages/ Misc

1999-06-08 Thread Brian J Beesley
"Ethan Hansen" <[EMAIL PROTECTED]> writes: > This is especially important if you are using a Xeon > processor, as there are interesting cache functionality problems that only > appear when a certain percentage of the die is used. Eh? 256K FFT = 2Mbyte work vector. Two copies needed, plus odds &