Mersenne Digest Tuesday, November 14 2000 Volume 01 : Number 792
----------------------------------------------------------------------
Date: Sun, 12 Nov 2000 13:57:05 -0800
From: Matthew Ashton <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Script to run mprime as a system daemon.
On Sun, Nov 12, 2000 at 12:08:25PM +0000, Gareth Randall wrote:
>
> I have been running mprime on Linux for some time and have
> recently written a script to make it run as a daemon on startup.
> mprime automatically nice's itself, which is very neat and makes
> it ideal for running this way.
>
> On my Debian 2.2 system:
>
<snip>
Hi Gareth,
I would just like to point out that mprime has been available as
part of Debian based Linux distributions for quite a while.
apt-get install prime-net
Version 19.1 is in Debian 2.2 (potato) and version 20.6 is available
for woody. It is probably worth mentioning that it is part of Debian
on www.mersenne.org (as prime-net). The Debian woody package can be
found here:
http://ftp.debian.org/dists/woody/non-free/binary-i386/misc/prime-net_20.6.2-2.deb
Thanks go to Francois Gouget <[EMAIL PROTECTED]> for putting this in
Debian. Go Debian! :-)
- ---
Matthew Ashton <[EMAIL PROTECTED]>
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Sun, 12 Nov 2000 17:18:10 -0800
From: "xqrpa" <[EMAIL PROTECTED]>
Subject: Mersenne: Prime Time: L-L Test Doesn't Exist?
This is a multi-part message in MIME format.
- ------=_NextPart_000_000B_01C04CCC.8839C2A0
Content-Type: text/plain;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
To All:
In case you missed the article "Prime Time" in New Scientist, the URL =
is:
https://www.newscientist.com/features/features.jsp?id=3Dns226444
The author goes on to write:
"Even so, it is mathematics that will gain the most. "Right now, when we =
tackle problems without knowing the truth of the Riemann hypothesis, =
it's as if we have a screwdriver," says Sarnak. "But when we have it, =
it'll be more like a bulldozer." For example, it should lead to an =
efficient way of deciding whether a given large number is prime. No =
existing algorithms designed to do this are guaranteed to terminate in a =
finite number of steps. "
Well, the L-L Test seems to be just such an algorithm.
Best Wishes,
Stefanovic
- ------=_NextPart_000_000B_01C04CCC.8839C2A0
Content-Type: text/html;
charset="iso-8859-1"
Content-Transfer-Encoding: quoted-printable
<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
<HTML><HEAD>
<META content=3D"text/html; charset=3Diso-8859-1" =
http-equiv=3DContent-Type>
<META content=3D"MSHTML 5.00.2614.3500" name=3DGENERATOR>
<STYLE></STYLE>
</HEAD>
<BODY bgColor=3D#ffffff>
<DIV>To All:</DIV>
<DIV> </DIV>
<DIV>In case you missed the article "Prime Time" in New Scientist, the =
URL=20
is:</DIV>
<DIV> </DIV>
<DIV><A=20
href=3D"https://www.newscientist.com/features/features.jsp?id=3Dns226444"=
>https://www.newscientist.com/features/features.jsp?id=3Dns226444</A></DI=
V>
<DIV> </DIV>
<DIV>The author goes on to write:</DIV>
<DIV> </DIV>
<DIV>
<P class=3Djustify>"Even so, it is mathematics that will gain the most. =
"Right=20
now, when we tackle problems without knowing the truth of the Riemann=20
hypothesis, it's as if we have a screwdriver," says Sarnak. "But when we =
have=20
it, it'll be more like a bulldozer." For example, it should lead to an =
efficient=20
way of deciding whether a given large number is prime. No existing =
algorithms=20
designed to do this are guaranteed to terminate in a finite number of =
steps.=20
"</P>
<P class=3Djustify>Well, the L-L Test seems to be just such an =
algorithm.</P>
<P class=3Djustify>Best Wishes,</P>
<P class=3Djustify>Stefanovic</P>
<P class=3Djustify> </P>
<P class=3Djustify> </P>
<P class=3Djustify> </P></DIV></BODY></HTML>
- ------=_NextPart_000_000B_01C04CCC.8839C2A0--
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Sun, 12 Nov 2000 20:54:57 -0500
From: Nathan Russell <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Prime Time: L-L Test Doesn't Exist?
To be fair, the quote says that it is difficult to determine the
primarlity of 'a given large number'. Only an infentesimal fraction of
arbitrary large numbers are Mersenne, or other special forms like
'Proth' primes.
Nathan
> xqrpa wrote:
>
> To All:
>
> In case you missed the article "Prime Time" in New Scientist, the URL
> is:
>
> https://www.newscientist.com/features/features.jsp?id=ns226444
>
> The author goes on to write:
>
>
> "Even so, it is mathematics that will gain the most. "Right now, when
> we tackle problems without knowing the truth of the Riemann
> hypothesis, it's as if we have a screwdriver," says Sarnak. "But when
> we have it, it'll be more like a bulldozer." For example, it should
> lead to an efficient way of deciding whether a given large number is
> prime. No existing algorithms designed to do this are guaranteed to
> terminate in a finite number of steps. "
>
> Well, the L-L Test seems to be just such an algorithm.
>
> Best Wishes,
>
> Stefanovic
>
>
>
>
>
>
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Sun, 12 Nov 2000 21:16:44 -0500
From: "FRANK_A_L_I_N_Y" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Prime Time: L-L Test Doesn't Exist?
I am not sure I can trust the author of the article. If you look closely, he
states that i is the square root of 1. i is the square root of -1
- ----- Original Message -----
From: "Nathan Russell" <[EMAIL PROTECTED]>
To: "xqrpa" <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]>
Sent: Sunday, November 12, 2000 8:54 PM
Subject: Re: Mersenne: Prime Time: L-L Test Doesn't Exist?
> To be fair, the quote says that it is difficult to determine the
> primarlity of 'a given large number'. Only an infentesimal fraction of
> arbitrary large numbers are Mersenne, or other special forms like
> 'Proth' primes.
>
> Nathan
>
> > xqrpa wrote:
> >
> > To All:
> >
> > In case you missed the article "Prime Time" in New Scientist, the URL
> > is:
> >
> > https://www.newscientist.com/features/features.jsp?id=ns226444
> >
> > The author goes on to write:
> >
> >
> > "Even so, it is mathematics that will gain the most. "Right now, when
> > we tackle problems without knowing the truth of the Riemann
> > hypothesis, it's as if we have a screwdriver," says Sarnak. "But when
> > we have it, it'll be more like a bulldozer." For example, it should
> > lead to an efficient way of deciding whether a given large number is
> > prime. No existing algorithms designed to do this are guaranteed to
> > terminate in a finite number of steps. "
> >
> > Well, the L-L Test seems to be just such an algorithm.
> >
> > Best Wishes,
> >
> > Stefanovic
> >
> >
> >
> >
> >
> >
> _________________________________________________________________________
> Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
> Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Sun, 12 Nov 2000 21:32:05 -0500
From: Nathan Russell <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Prime Time: L-L Test Doesn't Exist?
Yep. That's right up there with the press release from Cray that stated
that Slowinsky had discovered the 'thirty-nth prime number'.
Nathan Russell
FRANK_A_L_I_N_Y wrote:
>
> I am not sure I can trust the author of the article. If you look closely, he
> states that i is the square root of 1. i is the square root of -1
> ----- Original Message -----
> From: "Nathan Russell" <[EMAIL PROTECTED]>
> To: "xqrpa" <[EMAIL PROTECTED]>; <[EMAIL PROTECTED]>
> Sent: Sunday, November 12, 2000 8:54 PM
> Subject: Re: Mersenne: Prime Time: L-L Test Doesn't Exist?
>
> > To be fair, the quote says that it is difficult to determine the
> > primarlity of 'a given large number'. Only an infentesimal fraction of
> > arbitrary large numbers are Mersenne, or other special forms like
> > 'Proth' primes.
> >
> > Nathan
> >
> > > xqrpa wrote:
> > >
> > > To All:
> > >
> > > In case you missed the article "Prime Time" in New Scientist, the URL
> > > is:
> > >
> > > https://www.newscientist.com/features/features.jsp?id=ns226444
> > >
> > > The author goes on to write:
> > >
> > >
> > > "Even so, it is mathematics that will gain the most. "Right now, when
> > > we tackle problems without knowing the truth of the Riemann
> > > hypothesis, it's as if we have a screwdriver," says Sarnak. "But when
> > > we have it, it'll be more like a bulldozer." For example, it should
> > > lead to an efficient way of deciding whether a given large number is
> > > prime. No existing algorithms designed to do this are guaranteed to
> > > terminate in a finite number of steps. "
> > >
> > > Well, the L-L Test seems to be just such an algorithm.
> > >
> > > Best Wishes,
> > >
> > > Stefanovic
> > >
> > >
> > >
> > >
> > >
> > >
> > _________________________________________________________________________
> > Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
> > Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Mon, 13 Nov 2000 06:48:25 -0000
From: "Brian J. Beesley" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Prime Time: L-L Test Doesn't Exist?
On 12 Nov 00, at 17:18, xqrpa wrote:
> The author goes on to write:
>
> "Even so, it is mathematics that will gain the most. "Right now, when we
> tackle problems without knowing the truth of the Riemann hypothesis, it's
> as if we have a screwdriver," says Sarnak. "But when we have it, it'll be
> more like a bulldozer." For example, it should lead to an efficient way of
> deciding whether a given large number is prime. No existing algorithms
> designed to do this are guaranteed to terminate in a finite number of
> steps. "
>
> Well, the L-L Test seems to be just such an algorithm.
Indeed - in fact, even trial factoring terminates in a finite number
of steps. It's just that the finite number of trials required rapidly
becomes impossibly large.
I suppose what the author is trying to get at is that, given the
truth of the Generalized Reimann Hypothesis (aka Extended Reimann
Hypothesis), the primality of an arbitary number can be established
by executing a relatively small number of Miller's Tests - Miller's
Test being a well-known test which establishes whether a number is a
strong pseudoprime to a given base.
However, for Mersenne numbers, the LL test is still much to be
preferred - the running time of a single Miller's Test is comparable
to the running time of a LL test, whilst the number of Miller's Tests
required to establish the primality of a number of the order of
10^1000000 is over 10 million million, even given the GRH. [The
required number is 2(log n)^2]
This gets way above my head, but, according to Riesel, the GRH is
needed to prove that there is a "small" non-residue of order q mod p
for every prime p. I suppose that this may possibly be provable
independently of the GRH.
Regards
Brian Beesley
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Mon, 13 Nov 2000 15:52:43 +0100
From: Paul Landon <[EMAIL PROTECTED]>
Subject: Mersenne: Where's the FAQ
Hiya,
Where's the FAQ gone?
It's not at:-
http://www.exu.ilstu.edu/mersenne/faq-mers.txt
or
http://www.exu.ilstu.edu/mersenne/faq-mers
as it is linked from http://mersenne.org/faq.htm
I found one at
http://www.tasam.com/~lrwiman/FAQ-mers
Cheers,
Paul Landon
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Tue, 14 Nov 2000 06:45:56 -0000
From: "Tony Gott" <[EMAIL PROTECTED]>
Subject: Mersenne: Mac OS X
As the development of MAC Gimps seems to have come to a halt
I wondered if any of the Unix gurus out there had considered
porting the software to the unix base of the MAC OS X
operating system? Is this a big job, or is it possible to
use one of the existing unix ports to work on the OS?
Tony Gott
Shetland
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Tue, 14 Nov 2000 16:57:58 +0100
From: Guillermo Ballester Valor <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Mac OS X
Tony Gott wrote:
>
> As the development of MAC Gimps seems to have come to a halt
> I wondered if any of the Unix gurus out there had considered
> porting the software to the unix base of the MAC OS X
> operating system? Is this a big job, or is it possible to
> use one of the existing unix ports to work on the OS?
>
Well I'm not a UNIX guru. I've been writing a C program to make
Lucas-Lehmer test (Glucas). Some months ago I'll release a beta (or
alpha) version to ask help to extend the program to other platforms.
Only few volunteers make some binaries in few platforms, but there is
still the 'tune' work to do.
Because the time go fast, I decided no wait, in few days I will release
a new version of Glucas. It run fast enough to be compared with Mlucas.
It seems there is no problem in UNIX world but in other OS I will need
some more help.
So, you can try to make a binary, test, tune it and tell how it works.
It has a lot of advantages with respect MacLucasUNIX.
Best regards.
Guillermo.
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Tue, 14 Nov 2000 17:40:41 +0100
From: Guillermo Ballester Valor <[EMAIL PROTECTED]>
Subject: Mersenne: Interchangeable format for Mersenne number residues
Hi:
As I told in a recent mail to the list, I've been working to release
Glucas. One of the features it support is now write/read the 'save'
files in a platform independent style. I can use the residue files in
both my old Pentium-MMX and in a Alpha 21164.
The format is described in the page:
ftp://209.133.33.182/pub/valor/mformat.htm
Any comment, suggestion?.
Regards
Guillermo.
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Tue, 14 Nov 2000 13:57:09 -0500
From: "Gauthier, Jean" <[EMAIL PROTECTED]>
Subject: Mersenne: Refresh rate for prime95
When prime95 running my screen is always shaking.
Is there a workaround for this?
I can't let it run while i'm working because i will lose my vision soon.
Thanks
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Tue, 14 Nov 2000 19:45:05 -0000
From: "Mark Brown" <[EMAIL PROTECTED]>
Subject: RE: Mersenne: Refresh rate for prime95
> When prime95 running my screen is always shaking.
Are you using a Dell Optiplex? This suffers from a design flaw in which the
onboard video out is placed adjacent to the CPU and picks up EMF from the
CPU when the CPU is doing heavy FPU work (such as factoring primes).
It could be that other computers suffer similar problems.
> Is there a workaround for this?
For the Optiplex, run factoring only.
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: Tue, 14 Nov 2000 12:08:57 -0800 (PST)
From: John R Pierce <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Refresh rate for prime95
>
> > When prime95 running my screen is always shaking.
>
> Are you using a Dell Optiplex? This suffers from a design flaw in which the
> onboard video out is placed adjacent to the CPU and picks up EMF from the
> CPU when the CPU is doing heavy FPU work (such as factoring primes).
Its probably a power supply and local ground related issue.
One workaround would be to disable the onboard video and use a AGP card (if
thats an option on your particular Optiplex, there are a few different models)
>
> It could be that other computers suffer similar problems.
We had some gateway systems that chirped like a little cricket when running
LL tests. I think these were P5-133 generation machines.
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
Date: 15 Nov 2000 00:44:14 -0500
From: "Robert Deininger" <[EMAIL PROTECTED]>
Subject: Re: Mersenne: Interchangeable format for Mersenne number residues
On Tue, Nov 14, 2000 11:40 AM, [EMAIL PROTECTED] wrote:
>The format is described in the page:
>
> ftp://209.133.33.182/pub/valor/mformat.htm
>
>Any comment, suggestion?.
I would suggest one change. In your initial block, only put one item of
information -- the version number for the file format. Put everything else
currently in your block 0 into a subsequent block. Then increment the
format version whenever any changes or additions are made to the format.
This will make
later modifications a bit easier.
With your current format, changes in the definition of the first block are
likely. Why not make one block that is "safe", with a never-changing
format, so any program will always be able to read and understand the first
block? It only costs 8 more bytes.
Maybe you should allow more room for identifying the program. Each program
goes
through multiple versions, but you don't have room for the version. Maybe
an identifying number, and also a fixed-length, blank-padded character
string.
Glucas is still on my to-do list, but I haven't had many spare cycles
lately. Sorry.
- ---------------------------
Robert Deininger
[EMAIL PROTECTED]
_________________________________________________________________________
Unsubscribe & list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.exu.ilstu.edu/mersenne/faq-mers.txt
------------------------------
End of Mersenne Digest V1 #792
******************************
