Mersenne Digest Thursday, 4 February 1999 Volume 01 : Number 505
----------------------------------------------------------------------
From: Luke Hayter <[EMAIL PROTECTED]>
Date: Tue, 2 Feb 1999 14:29:21 -0000
Subject: Mersenne: Primes95 for SunOS 4.1.4
Hi,
I'm hoping someone can help clear up a question for me.
Is there a Unix prime search app that does what Primes95 does ?
The graphical front end isn't needed, just the ability to configure
it, and it run happily in the background with little need for
manual interaction other than some way of finding out the status of
the searching.
There are 3 SunOS workstations in this office that sit doing little
more than reading and displaying files - so they can be kept busy
testing for primes.
Having looked at the various sites and archives the above question
doesn't appear to be answered - or I'm blind.
Two workstations are SunOS Release 4.1.4, and one is SunOS 4.1.2.
We don't have GCC installed, but can install it if necessary.
Please can someone point me in the direction of more help.
Thanks in advance (and apologies if this is wasting your time),
Luke
------------------------------
From: Paul Derbyshire <[EMAIL PROTECTED]>
Date: Tue, 02 Feb 1999 11:16:34 -0500
Subject: Re: Mersenne: Primes95 for SunOS 4.1.4
At 02:29 PM 2/2/99 -0000, you wrote:
>Hi,
>
>I'm hoping someone can help clear up a question for me.
>
>Is there a Unix prime search app that does what Primes95 does ?
>The graphical front end isn't needed, just the ability to configure
>it, and it run happily in the background with little need for
>manual interaction other than some way of finding out the status of
>the searching.
>
>There are 3 SunOS workstations in this office that sit doing little
>more than reading and displaying files - so they can be kept busy
>testing for primes.
You can always try to compile mprime on these. The network code might need
platform-specific tweaking but the guts of the primality testing stuff
ought to be portable C.
Has anyone gotten mprime to run on SunOS? If so, this fellow might
appreciate anything you might know about tweaking the network code for SunOS.
- --
.*. "Clouds are not spheres, mountains are not cones, coastlines are not
- -() < circles, and bark is not smooth, nor does lightning travel in a
`*' straight line." -------------------------------------------------
-- B. Mandelbrot |http://surf.to/pgd.net
_____________________ ____|________ Paul Derbyshire [EMAIL PROTECTED]
Programmer & Humanist|ICQ: 10423848|
------------------------------
From: Paul Derbyshire <[EMAIL PROTECTED]>
Date: Tue, 02 Feb 1999 16:38:16 -0500
Subject: [Meta] List cloggage? was Re: Mersenne: Primes95 for SunOS 4.1.4
At 11:16 AM 2/2/99 -0500, I wrote:
>You can always try to compile mprime on [the 3 SunOS boxen]. The network
code might need
>platform-specific tweaking...
but it only showed up now at 16:37 2/2/99 -0500! Mail slowups at base.com?
- --
.*. "Clouds are not spheres, mountains are not cones, coastlines are not
- -() < circles, and bark is not smooth, nor does lightning travel in a
`*' straight line." -------------------------------------------------
-- B. Mandelbrot |http://surf.to/pgd.net
_____________________ ____|________ Paul Derbyshire [EMAIL PROTECTED]
Programmer & Humanist|ICQ: 10423848|
------------------------------
From: Jonathan A Zylstra <[EMAIL PROTECTED]>
Date: Tue, 2 Feb 1999 16:16:57 -0800
Subject: Re: Mersenne: Rewards for prime stuff?
On Mon, 1 Feb 1999 20:52:02 EST [EMAIL PROTECTED] writes:
>In a message dated 2/1/99 6:38:53 PM Eastern Standard Time,
>[EMAIL PROTECTED]
>writes:
>
>> Hi.
>> Just to continue the delightfully irrelevant string of
>almost-off-topic
>> posts, I note that -3i (where i is the square root of -1) has the
>same
>> absolute value as 3, so it IS as small a factor, by some
>definition.
>
>I have seen definitions of factoring that define 1, -1, i, -i as
>"units", and
>prove that every integer can be factored uniquely into the product of
>positive
>prime integers and one "unit". So yes, -3i is a factor, but it should
>be
>considered "composite."
A prime is defined as a number divisible only by itself and 1
According to this then, than can a prime be difined as a number divisible
only by itself and one "unit"?
So why is -3i composite?
It is only divisible by 3 and -i , or by a product of one (1) + prime
int., and one (1) unit.
J. Zylstra
[EMAIL PROTECTED]
___________________________________________________________________
You don't need to buy Internet access to use free Internet e-mail.
Get completely free e-mail from Juno at http://www.juno.com/getjuno.html
or call Juno at (800) 654-JUNO [654-5866]
------------------------------
From: "David N. Moreno (El Guapo)" <[EMAIL PROTECTED]>
Date: Tue, 2 Feb 1999 19:06:22 -0800 (PST)
Subject: Mersenne: Prime testing on 486 running linux
Hi All,
I am having a software problem(GIMPS), and am hoping somebody has had a
similar expierience. I have a 486 DX4-100 running linux (Slackware,
kernel 2.0.34, 16 meg of RAM) and I cant get either of the linux versions
available to work on my machine.
I had kernel 2.0.0 running a few months back, and the software was
happy, but my HD crashed and burned, so I (completely) reinstalled w/
2.0.34 . I am just getting back into things, and I went to reinstall the
prime checking software, and it Seg Faults, (both versions) every time I
run it. The only difference is that the newer version on the website will
allow me to do a 'mprime -v' and it will print out the version, but thats
it, everything else Seg Faults
So.... Anybody have any ideas? I know that one option is to compile
from the source, but I have doubts as to my abilities to 'tweak' the code
enough to get it to run. So hopefully someone knows whas wrong and can
help
Please let me know,
Dave Moreno
[EMAIL PROTECTED]
[EMAIL PROTECTED]
******************************************************************
Dave Moreno Office Phone:(805)756-6455
Math Dept. Cal Poly,SLO Office: Building 24 Room 104
******************************************************************
------------------------------
From: "Foghorn Leghorn" <[EMAIL PROTECTED]>
Date: Tue, 02 Feb 1999 23:13:51 EST
Subject: Re: Mersenne: Rewards for prime stuff?
>A prime is defined as a number divisible only by itself and 1
>According to this then, than can a prime be difined as a number
divisible
>only by itself and one "unit"?
>So why is -3i composite?
>It is only divisible by 3 and -i , or by a product of one (1) + prime
>int., and one (1) unit.
>
>J. Zylstra
>[EMAIL PROTECTED]
In ring theory, a unit is any element with a multiplicative inverse. In
the ring of Gaussian integers (a+bi with a,b in Z) the units are 1, -1,
i, -i. An associate of an element x is the product of x with some unit.
An irreducible element is defined as one having no divisors other than
the units and its associates. An element is prime if it has the property
that whenever it divides a product, it must also divide one of the
factors. This definiton of primality differs a little from the general
usage, but it is explained by the fact that primality and irreducibility
are equivalent in the ring of integers. This isn't true in some other
rings.
There is a set of rules for determining primes in the Gaussian integers
based on primes in the integers, but it has been awhile since I've
looked at them and I don't have the book handy.
What did this have to do with Mersenne primes, again? :)
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
------------------------------
From: Henrik Olsen <[EMAIL PROTECTED]>
Date: Wed, 3 Feb 1999 09:07:48 +0100 (CET)
Subject: Re: Mersenne: Prime testing on 486 running linux
On Tue, 2 Feb 1999, David N. Moreno (El Guapo) wrote:
> Hi All,
>
> I am having a software problem(GIMPS), and am hoping somebody has had a
> similar expierience. I have a 486 DX4-100 running linux (Slackware,
> kernel 2.0.34, 16 meg of RAM) and I cant get either of the linux versions
> available to work on my machine.
<Lots snipped>
I have essentially the same problem, mprime segfaults on a 486, I tried
with both Slackware 3.5.0 and RedHat 5.2, exact same library and kernel
versions as the ones in the pentium machines I run mprime on.
My "solution" has been to use that machine for ecmnet instead. (and as a
fax machine, that's why it's always running:)
- --
Henrik Olsen, Dawn Solutions I/S
URL=http://www.iaeste.dk/~henrik/
Get the rest there.
------------------------------
From: Henrik Olsen <[EMAIL PROTECTED]>
Date: Wed, 3 Feb 1999 09:38:59 +0100 (CET)
Subject: Re: Mersenne: Primes95 for SunOS 4.1.4
On Tue, 2 Feb 1999, Luke Hayter wrote:
> Is there a Unix prime search app that does what Primes95 does ?
> The graphical front end isn't needed, just the ability to configure
> it, and it run happily in the background with little need for
> manual interaction other than some way of finding out the status of
> the searching.
>
> There are 3 SunOS workstations in this office that sit doing little
> more than reading and displaying files - so they can be kept busy
> testing for primes.
>
> Having looked at the various sites and archives the above question
> doesn't appear to be answered - or I'm blind.
>
> Two workstations are SunOS Release 4.1.4, and one is SunOS 4.1.2.
> We don't have GCC installed, but can install it if necessary.
>
> Please can someone point me in the direction of more help.
Check http://www2.netdoor.com/~acurry/mersenne/freeware.html for source
versions of the original program.
They won't include automatic assignment of work to do, so you'll get
to do some manual work in giving them assignments, check
http://entropia.com/ips/manualtests.html for info on getting assignments.
- --
Henrik Olsen, Dawn Solutions I/S
URL=http://www.iaeste.dk/~henrik/
Get the rest there.
------------------------------
From: Paul Leyland <[EMAIL PROTECTED]>
Date: Wed, 3 Feb 1999 01:52:43 -0800
Subject: RE: Mersenne: Rewards for prime stuff?
> There is a set of rules for determining primes in the
> Gaussian integers
> based on primes in the integers, but it has been awhile since I've
> looked at them and I don't have the book handy.
The Gaussian primes are 1+i (and associates); integer primes of the form
4n+3 (and their associates) and the factors of integral primes of the form
4n+1. The latter can always be expressed as a^2+b^2 and so their
factorization into Gaussian primes is (a+bi)(a-bi).
The "smallest" Gaussian primes (i.e. the ones of smallest modulus) are
1+i, 3, 2+i, 7, 11, 8+i, 19, 23, 5+2i, ... and their associates.
Paul
------------------------------
From: Paul Leyland <[EMAIL PROTECTED]>
Date: Wed, 3 Feb 1999 05:26:00 -0800
Subject: RE: Mersenne: Rewards for prime stuff?
> The Gaussian primes are 1+i (and associates); integer primes
> of the form
> 4n+3 (and their associates) and the factors of integral
> primes of the form
> 4n+1. The latter can always be expressed as a^2+b^2 and so their
> factorization into Gaussian primes is (a+bi)(a-bi).
>
> The "smallest" Gaussian primes (i.e. the ones of smallest modulus) are
>
> 1+i, 3, 2+i, 7, 11, 8+i, 19, 23, 5+2i, ... and their associates.
It's been pointed out to me that (8+i) is composite, with factorization
8 + i = (2 - i) * (3 + 2*i).
Oops! That's what comes of performing factorizations in my head and without
checking before posting. I meant, of course, 4+i. For some bizarre reason,
I divided 16 by 2, rather than taking its square root.
I also omitted the prime factors of 13 (3+2i and associates) from the list.
My apologies for spreading misinformation.
Paul
------------------------------
From: "Jean-Charles Meyrignac" <[EMAIL PROTECTED]>
Date: Wed, 3 Feb 1999 15:12:42 +0100
Subject: Mersenne: PrimeNet productivity
Today, Primenet status page contains:
Last 7 Days Average Cumulative Today
from 99-Jan-27 06h from 99-Feb-02 06h
Test Type CPU yr/day GFLOP/s CPU years CPU yr/day
------------ ---------- ---------- ---------- ----------
Lucas-Lehmer 36.852 443.609 48.469 36.392
Factoring 1.442 17.358 1.845 1.386
---------- ---------- ---------- ----------
TOTALS 38.294 460.966 50.314 37.777
50.314 years/day !!!
It seems that a massive number of new members have sent results.
------------------------------
From: "Sander Hoogendoorn" <[EMAIL PROTECTED]>
Date: Wed, 03 Feb 1999 11:12:33 PST
Subject: Re: Mersenne: PrimeNet productivity
This page also shows that the number of inactive accounts is raising
harder then the active accounts. Since the last newsletter was from may
22 (or did i miss one?) it might be a good idea for a new one to wake
all these people because not all people who are testing are members of
this mailing list
>From [EMAIL PROTECTED] Wed Feb 3 08:57:20 1999
>Received: (from majordomo@localhost)
> by acid.base.com (8.8.5/8.8.5) id HAA28596
> for mersenne-outgoing; Wed, 3 Feb 1999 07:43:01 -0800
>Received: from bouvreuil.cybercable.fr (bouvreuil.cybercable.fr
[212.198.3.12])
> by acid.base.com (8.8.5/8.8.5) with SMTP id HAA28589
> for <[EMAIL PROTECTED]>; Wed, 3 Feb 1999 07:42:58 -0800
>Message-Id: <[EMAIL PROTECTED]>
>Received: (qmail 3772 invoked from network); 3 Feb 1999 14:11:42 -0000
>Received: from d130.paris-35.cybercable.fr (HELO jc) (212.198.35.130)
> by bouvreuil.cybercable.fr with SMTP; 3 Feb 1999 14:11:42 -0000
>From: "Jean-Charles Meyrignac" <[EMAIL PROTECTED]>
>To: "Mersenne Base" <[EMAIL PROTECTED]>
>Subject: Mersenne: PrimeNet productivity
>Date: Wed, 3 Feb 1999 15:12:42 +0100
>X-MSMail-Priority: Normal
>X-Priority: 3
>X-Mailer: Microsoft Internet Mail 4.70.1155
>MIME-Version: 1.0
>Content-Type: text/plain; charset=ISO-8859-1
>Content-Transfer-Encoding: 7bit
>Sender: [EMAIL PROTECTED]
>Precedence: bulk
>
>Today, Primenet status page contains:
>
> Last 7 Days Average Cumulative Today
> from 99-Jan-27 06h from 99-Feb-02 06h
>
> Test Type CPU yr/day GFLOP/s CPU years CPU yr/day
> ------------ ---------- ---------- ---------- ----------
> Lucas-Lehmer 36.852 443.609 48.469 36.392
> Factoring 1.442 17.358 1.845 1.386
> ---------- ---------- ---------- ----------
> TOTALS 38.294 460.966 50.314 37.777
>
>50.314 years/day !!!
>
>It seems that a massive number of new members have sent results.
>
>
______________________________________________________
Get Your Private, Free Email at http://www.hotmail.com
------------------------------
From: Gary Untermeyer <[EMAIL PROTECTED]>
Date: Wed, 03 Feb 1999 14:28:40 -0700
Subject: Re: Mersenne: PrimeNet productivity
Greetings,
This appears to be a glitch in the program. The "CPU years" cannot be
greater than the "CPU yr/day". I have noticed from time to time in recent
weeks that the counter for "CPU years" does not roll back to zero at 06h
every day, which I think it is supposed to do, thereby allowing it to
accumulate more than 24 hours worth of work. The "CPU yr/day" formula
seems to take this into account, however.
I have been in the search for more than two years now, way before Primenet
came along. I'm sure everyone that has been on this ride for long enough
to remember being able to LL-test exponents below 2,000,000 for the first
time will agree that 35 to 40 years of work in a single day was never
expected, only dreamed about. Whoda thought we be testing in the 6,000,000
range by now?!?
How about some predictions on when the whole range up to 20,500,000 will
be:
1) completely factored to the available limit of the program?
2) completely first time LL-tested?
3) completely double-checked?
With the GIMPS status page showing about 535 millennium of P90 work to go,
considering present production, factors yet to be found and more and faster
computers coming online to help, I predict that all of the above will be
accomplished in under 10 years. Any comments?
Regards,
Gary Untermeyer
Jean-Charles Meyrignac wrote:
> Today, Primenet status page contains:
>
> Last 7 Days Average Cumulative Today
> from 99-Jan-27 06h from 99-Feb-02 06h
>
> Test Type CPU yr/day GFLOP/s CPU years CPU yr/day
> ------------ ---------- ---------- ---------- ----------
> Lucas-Lehmer 36.852 443.609 48.469 36.392
> Factoring 1.442 17.358 1.845 1.386
> ---------- ---------- ---------- ----------
> TOTALS 38.294 460.966 50.314 37.777
>
> 50.314 years/day !!!
>
> It seems that a massive number of new members have sent results.
------------------------------
From: Gordon Irlam <[EMAIL PROTECTED]>
Date: Wed, 03 Feb 1999 14:01:40 -0800
Subject: Re: [Meta] List cloggage? was Re: Mersenne: Primes95 for SunOS 4.1.4
Paul Derbyshire wrote:
> At 11:16 AM 2/2/99 -0500, I wrote:
> >You can always try
>
> but it only showed up now at 16:37 2/2/99 -0500! Mail slowups at base.com?
Nothing out of the ordinary that I am aware of.
The mailer delivers to all 470 subscribers sequentially. So, if your
name is near the end of the list, and if a many DNS and SMTP timeouts
occur before it gets around to delivering to you, it can sometimes take
several hours.
FWIW, I will be upgrading base.com from a 28.8k analog modem to a
128k/384k+ DSL line in the next month or two. Although I am not sure
this will appreciably speed up message delivery.
gordoni (list admin)
------------------------------
End of Mersenne Digest V1 #505
******************************
