Re: Mersenne: Factoring on a P4

2001-06-22 Thread Michael Bell
> BTW there was an "unreasonable" acceleration of trial factoring > between the P5 architecture (Pentium Classic/MMX) and the P6 > architecture (Pentium Pro / PII / PIII / Celeron / Xeon), so you > can't simply assume that Intel doesn't care about integer > performance! But they clearly don't

Re: Mersenne: Prime95 - V21.1.1 aka v21a

2001-06-18 Thread Michael Bell
> H, > I am not getting any performance increase on my 2 Athlon's here, and I am > 99% sure they are Thunderbirds. It appears I was wrong, the prefetch is available on all Athlons not just Thunderbirds, so it must be something else. Michael.

Re: Mersenne: Prime95 - V21.1.1 aka v21a

2001-06-18 Thread Michael Bell
> Note also that the Athlon *did* have a performance increase > on par with the Celeron 2 and P3 machines > > Eric Is it possible that the Athlon that didn't see the increase was an original Athlon (rather than a T'bird) and so didn't have the prefetch instructions? Michael.

Re: Mersenne: Bug?

2001-05-25 Thread Michael Bell
> Hi > > I was playing around with the client program. > When I go to the advanced menu and choose ecm, there I fill in for exponent 101 and check the factor 2^N-1 box and click ok. > After about a minute the program says to me : > > Stage 1 complete. 25964568 transforms, 1 modular inverse. Time:

Re: Mersenne: Quitting GIMPS

2001-03-13 Thread Michael Bell
Hi, I also quit GIMPS a couple of years ago, after completing one Lucas-Lehmer test. I then hopped around various distributed projects, including RC5, OGR (before it was run by distributed, and since it has been), sum of powers etc. As I'm interested in prime numbers I have ended up spending mos

Re: Mersenne: Re: Algorithm improvements?

2000-07-16 Thread Michael Bell
> "Steinar H. Gunderson" wrote: > > > > On Sun, Jul 16, 2000 at 12:46:03PM +0200, Martijn wrote: > > >Furthermore, one could save the value of for instance the 10 000th > > >iteration, and check if a later iteration gets the same value, > > >if it does, one knows that the value will never get to 0

Re: Mersenne: Algorithm improvements?

2000-07-16 Thread Michael Bell
a - I think it may suffer from the problem of increasing the time of each iteration, therefore even though it saves a bit of speed on each iteration it might not cause an overall speed up. Michael Bell. _ Unsubscribe & list

Mersenne: Motherboard Temperature

2000-06-29 Thread Michael Bell
Hi, Soory to be a little off topic, can somebody tell me how hot a motherboard should be running? I have a Celeron 466 and an ASUS P2B-B. It claims to be 42 degrees after some days of continuous use. Is this normal? Thanks, Michael. _

Re: Mersenne: Re: Pointers on farming

2000-06-17 Thread Michael Bell
eron in instead, although a 500MHz Celeron costs about £85 instead of 45, you get back to your 37pence/MHz figure. Also note memory prices have gone up, so 32M now costs about £40-50!! Maybe this is the first time in recent history the price of a computer has stabilised?? Michael Bell. ___

Re: Mersenne: Need info about K6

1999-03-26 Thread Michael Bell
I have a K6-2/300, and it is much slower than a Pentium. I actually use it for RC5 because it is so slow at LL testing, though I have a K6/233 doing factoring work. The K6 suffers because a) it can't do FXCH at the same time as another FP instruction (which Pentium's can), and also it can on

Re: Mersenne: mersennes for exocivilizations

1999-03-08 Thread Michael Bell
> > The above is a steadily increasing sequence, which could be used to advantage. > One could represent delta n for additional compression. > 1,1,1,1,2,1,1,3,7,6,4,3,67,12,... has fewer bits. > Then put the message through something standard like Huffman or LZH. > The difficulty is that with eac

Re: Mersenne: N and F

1999-01-09 Thread Michael Bell
"Benny.VanHoudt" wrote: > > I mentioned that this was true for all N if F is an odd factor, > it's a bit more complicated, it is only true for N even > if F is an odd factor and F is small enough. > This because we can't use negative numbers. > > For example 12 = 3 + 4 + 5 (F=3, Q=4) works and >