I just joined GIMPS (now 6% done testing a number with exponent just
short of 10M if it makes a difference) and I have been looking into the
theory behind Mersenne primes.
Can anyone show me or at least point me to a webpage with the proof that
the exponent of a Mersenne prime must be
From: Your Name [EMAIL PROTECTED]
Reply-To: [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Mersenne: Manual Use of Primenet
Date: Sun, 27 Feb 2000 22:56:48 -0500
I've got a possible glitch report regarding the manual use of Primenet
which may be useful, and a couple of comments.
I run
Something I've been wondering about since entering this project -
How much are the people who are trying to find a 10 million digit prime
contributing to the search? They stand less than a tenth the ordinary
chance per unit time, and any prime they find will take at least four or
five years
From: Spike Jones [EMAIL PROTECTED]
Reply-To: [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Mersenne: searching the biggies
Date: Thu, 02 Mar 2000 19:49:36 -0800
Nathan Russell asked: How much are the people who are trying to
find a 10 million digit prime contributing to the search?
Any
From: "Aaron Blosser" [EMAIL PROTECTED]
To: "Mersenne@Base. Com" [EMAIL PROTECTED]
Subject: RE: Mersenne: searching the biggies 2
Date: Thu, 2 Mar 2000 21:33:23 -0700
On the other hand, the existence of the EFF prize is a useful
tool in convincing companies to run GIMPS, for most IT
From: "Dave Mullen" [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Mersenne: Re: How much are the 10 M gamblers contributing?
Date: Fri, 3 Mar 2000 17:42:02 +0800
Perhaps I'm a little under-speed here ...
I understood that the $100,000 award was for the first 10 million digit
(that is to
From: George Woltman [EMAIL PROTECTED]
To: "Nathan Russell" [EMAIL PROTECTED],[EMAIL PROTECTED]
Subject: Re: Mersenne: searching the biggies
Date: Fri, 03 Mar 2000 11:39:44 -0500
Hi,
At 11:42 PM 3/2/00 -0500, Nathan Russell wrote:
Nathan Russell asked: How much are the people who
From: George Woltman [EMAIL PROTECTED]
To: "Nathan Russell" [EMAIL PROTECTED]
Subject: Re: Mersenne: searching the biggies
Date: Fri, 03 Mar 2000 16:32:10 -0500
Hi,
I don't honestly think I would have the patience to run 10 M tests,
Me too. 1 year for a 1 in 250,000 chance -
From: Jukka Tapani Santala [EMAIL PROTECTED]
To: Nathan Russell [EMAIL PROTECTED]
CC: [EMAIL PROTECTED]
Subject: Re: Mersenne: searching the biggies
Date: Sat, 4 Mar 2000 01:19:56 +0200 (EET)
On Fri, 3 Mar 2000, Nathan Russell wrote:
Two of their other projects lost GIMPS-years of work each
From: Walt Mankowski [EMAIL PROTECTED]
To: Mersenne discussion list [EMAIL PROTECTED]
Subject: Re: Mersenne: 386SX
Date: Sat, 4 Mar 2000 19:01:51 -0500
(much snippage)
It might be able to work on one of the distributed.net projects. I
don't *think* the rc5 stuff uses floating point.
It
have
cached in case of such interruptions? Currently I'm set through May 9.
Nathan Russell
__
Get Your Private, Free Email at http://www.hotmail.com
_
Unsubscribe list info -- http://www.scruz.
In a scan of the PrimeNet status page
(http://www.entropia.com/primenet/status.txt)
I noticed that this exponent was due to expire sometime around last
Halloween.
Is there a bug in the server? Is the owner a QA person who is being given
some leniency? If so, why is the server being used?
From: George Woltman [EMAIL PROTECTED]
To: "Nathan Russell" [EMAIL PROTECTED],[EMAIL PROTECTED]
CC: [EMAIL PROTECTED]
Subject: Re: Possible V20 issue
Date: Mon, 20 Mar 2000 19:03:06 -0500
Hi,
At 05:46 PM 3/20/00 -0500, Nathan Russell wrote:
I have noticed that, when I finish t
y expected. I
feel that this is an issue that should be resolved before v 20 is offered as
a public release, even in resolving it means just adding a line to the
output so that others are not confused as I have been.
Respectfully,
Nathan Russell
__
Get Your
to their questions, and
more experienced participants could have their concerns addressed or debate
issues without inconviencing those who have no immediate interest.
Nathan Russell
__
Get Your Private, Free Email at http://www.hotmail.com
means let me
know.
Regards,
Nathan Russell
__
Get Your Private, Free Email at http://www.hotmail.com
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime
that compliments go to us all.
Regards,
Nathan Russell
__
Get Your Private, Free Email at http://www.hotmail.com
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
From: Jukka Santala [EMAIL PROTECTED]
Reply-To: [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: IRC?
Date: Wed, 22 Mar 2000 20:01:04 +0200
That's not a problem, it's the purpose of IRC... ;) Regardless, I've
(intermittently) keeping up the channel #Mersenne on DALnet IRC network
t machines
that can easily do LL work has chosen to not only do factoring, but to cache
an amount of factoring work that would normally take GIMPS as a whole months
to finish.
Regards,
Nathan Russell
__
Get Your Private, Free Email at http://www.h
After this is resolved, should all of us use the manual pages to get rid of
our factoring assignments and get new, lower ones?
I know that I, for one, have two factoring assignments saved up just to
provide a bit of variety between tests
Regards,
Nathan Russell
I appologize for the misunderstanding. The reason I was upset was not
because you used ten machines to do factoring. Even two hundred machines
doing factoring would not have changed the overall balance of GIMPS much.
At the time of my message, I thought that you had deliberately gotten
er month. Going on vacation? No problem.
Your machine grabs, say, 100 assignments out of its quote for the month
and it's set for three or four months.
Just so we know, how long would it take a 1.5 Ghz Athlon to factor 100
assignments through 64 bits? In view of Moore's Law, that's about w
From: "Brian J. Beesley" [EMAIL PROTECTED]
To: "Nathan Russell" [EMAIL PROTECTED]
CC: [EMAIL PROTECTED]
Subject: RE: Mersenne: The recent popularity of Factoring
Date: Sun, 26 Mar 2000 18:57:51 -
What about this: 300 assignments per month. Going on vacation? No
t the time, factoring thousands of exponents without a good
reason.
Trying to sound sane,
Nathan Russell
__
Get Your Private, Free Email at http://www.hotmail.com
_
Unsubscribe list in
From: "Brian J. Beesley" [EMAIL PROTECTED]
To: "Geoffrey Faivre-Malloy" [EMAIL PROTECTED]
CC: [EMAIL PROTECTED]
Subject: RE: Mersenne: The recent popularity of Factoring
Date: Sun, 26 Mar 2000 07:39:15 -
Geoffrey Faivre-Malloy wrote:
Stuff that we've already gone over and dabated for a few
From: "Halliday, Ian" [EMAIL PROTECTED]
Reply-To: [EMAIL PROTECTED]
To: Aaron Blosser [EMAIL PROTECTED]
CC: "Mersenne@Base. Com" [EMAIL PROTECTED]
Subject: Re: Mersenne: GIMPS in Science News
Date: Thu, 30 Mar 2000 20:29:22 +1200
This brings to mind a question I have been considering for a
From: "Frank_A_L_I_N_Y" [EMAIL PROTECTED]
To: "Stefan Struiker" [EMAIL PROTECTED], [EMAIL PROTECTED]
CC: "James Escamilla" [EMAIL PROTECTED], [EMAIL PROTECTED]
Subject: Re: Mersenne: GIMPS in Science News
Date: Thu, 30 Mar 2000 14:23:34 -0500
what aobut the fact that our tests will take longer
From: Bryon Buck [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: GIMPS in Science News
Date: Fri, 31 Mar 2000 00:01:53
1. To the average person, aliens are a lot "sexier" than prime numbers.
Anyone can picture little green men from Mars, but it takes a special
person to
From: Yvan Dutil [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: GIMPS in Science News
Date: Fri, 31 Mar 2000 14:45:22 +0100
Well, I think the diffence of culture between the people of GIMPS and those
of SETI@Home can be illustred simply by the comparaison of subject of
answer this for you.
BTW, I'm a relative newbie here, and any/all of the info I have given you
may be incorrect.
Regards,
Nathan Russell
__
Get Your Private, Free Email at http://www.hotmail.com
this information anywhere.
Thanks,
Nathan Russell, unofficial GIMPS pet newbie :-)
__
Get Your Private, Free Email at http://www.hotmail.com
_
Unsubscribe list info -- http://www.scruz.net/~luke
To start with, thanks to all those who answered my first question.
What I want to know is as follows: If no factors are found for an exponent
after running the needed curves for a 55 digit factor, what is done? Are
additional curves run, or is that exponent put aside to await improvements
in
It certainly did help me! So, why are only certain ranges listed on the
PrimeNet status page? For example, from time to time, their front page has
failed to list the 'cutting edge' of PrimeNet factoring assignments.
As a somewhat related question, when an apparent double-checking milestone
From: George Woltman [EMAIL PROTECTED]
To: "David Campeau" [EMAIL PROTECTED], [EMAIL PROTECTED]
Subject: Re: Mersenne: V20 beta #4 (will the beta never end?)
Date: Thu, 20 Apr 2000 11:43:46 -0400
Hi,
At 07:47 AM 4/20/00 -0400, David Campeau wrote:
Seeing that not every time a stage 1 gcd will
Well, it wasn't strictly a double post - my browser crashed just as I was
sending the second, and I wasn't sure whether it'd been sent, so I rewrote
it.
Nathan
__
Get Your Private, Free Email at http://www.hotmail.com
(much snippage dealing with factoring on behalf of non-PC machines)
Then again, if
one turned a MP machine to factoring, GIMPS might soon
run out of factoring assignments, which would not please
those with 486s and other slower CPUs whose only useful
contribution to GIMPS is factoring.
Cheers,
Hi,
I was just checking my account report. I have always kept about 2 weeks of
double checking assignments in case my QA work finishes and I am unable to
get more for some reason. Those assignments that I have checked out with
v20 (some combination of betas #2-4 I believe) state on the
Hi,
At Wed, 26 Apr 2000 22:11:58 -0400
George Woltman explained:
What I do is just re-issue them as first time tests. The last time I did
this was
roughly six months ago. I don't feel very guilty about this as there is
about
a 50% chance the first test was no good and these exponents
I have been talking with the distributed.net IRC channel, #distributed on
EFnet. I am known there as Trekkie. I've been telling them about the
greater chance of a successful result. The channel operators are okay with
this, and it's provoking a lively discussion.
If anyone wants to join
have been unclear, these errors are in no way due to a hardware
problem with your machine, so there is no need to worry about that.
Best regards,
Nathan Russell
Get Your Private, Free E-mail from MSN Hotmail at http://www.h
From: "Brian J. Beesley" [EMAIL PROTECTED]
To: "Nathan Russell" [EMAIL PROTECTED]
CC: [EMAIL PROTECTED]
Subject: Re: Mersenne: The sound of M(M(19))
Date: Sun, 7 May 2000 08:58:21 -
Much more likely to be related to a resonance with the speed at which
the FFT works at
If the PrimeNet assignments reports are to be believed, we have
double-checked all exponents through 3M and proven M(2976221) and M(3021377)
to be respectively the 36th and 37th primes in numeric order.
Nathan
Get Your
From: Jeff Woods [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: Milestones?
Date: Tue, 09 May 2000 12:37:31 -0400
We still have a handful of exponents to go.
I was looking at the server's assignments out pages. I guess the
assignments in question must be non-PrimeNet.
takes longer
for hardware-related reasons that appear in the list archives a week or two
back, IIRC.
Regards
Nathan Russell
Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com
Hi all,
There is a user, "sd70045", who has almost 100 single-checkingassignments
out on a single machine ID. These would take a state-of-the-art box well
over two years to finish. Additionally, these assignments have almost
identical figures for time to complete etc. The first exponent in
I just got this in an ECM run on M(10079). What does it mean? Is something
wrong with my machine?
[Thu May 25 15:00:24 2000]
ECM found a factor in curve #263, stage #2
Sigma=1155032128984, B1=25, B2=2500.
ERROR: Factor doesn't divide N!
Nathan
Hi everyone,
George contacted me and stated that he was unable to recreate the error and
suspects that it was a one-time fluke; he wants me to let him know if it
recurs. This is the first error I have had on the machine, so I am not
concerned. Thanks to all who gave advice.
Nathan
P.S. I
"Brian J. Beesley" wrote:
There was a problem with some versions which resulted in this error
message appearing constantly. I think the problem was related to a
factor which was already known being found again - this happens
constantly but should be resolved by reference to the low?.txt
The memory setting is only relevant for P-1 factoring, not for
LL-testing or
classical factoring.
Kind Regards, Martijn
It should probably be added that additional memory actually only makes P-1
go to higher bounds, thereby increasing the chance of avoiding an LL test.
It will do little or
From: Stefan Struiker [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Mersenne: Manual Testing Forms Still "Broken"
Date: Wed, 07 Jun 2000 06:14:38 -0700
To All:
In the server transition, the Manual Testing Forms still
seem to be broken. Can't UNreserve exponents, for example.
Best
page doesn't presently list a P90, so you might try
linear interpolation or use the handy java applet.
Happy testing,
Nathan Russell
Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com
ced chance of
finding a prime.
Regards,
Nathan Russell
Get Your Private, Free E-mail from MSN Hotmail at http://www.hotmail.com
_
Unsubscribe list in
From: Paul Leyland [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Mersenne: Account inconsistency
Date: Thu, 8 Jun 2000 13:33:05 -0700
Can anyone explain this inconsistency in what the server believes the MSRC
account has done?
I have a hunch, but it could be wrong. If a double-checker
Stefan Struiker asked:
Is a single Double Check always enough to retire an exponent?
Regards,
Stefanovic
IIRC, George compares the residues once per week of all the double-checks
compared that ween when he updates the database. If they don't match, then
either one or both of the previous
Hi all,
In order to learn hardware before leaving for college, I have taken a
full-time job at a local computer recycling place. Since I will be
attending college on a rather nice scholarship, I will have more money than
I am likely to need in the immediate future; through my work, I will
From: Jeff Woods [EMAIL PROTECTED]
To: [EMAIL PROTECTED]
Subject: Re: Mersenne: Factoring Assignments: Are They Always
"First-Time?"
Date: Sat, 17 Jun 2000 17:14:00 -0400
At 01:00 PM 6/17/00 -0700, you wrote:
(snip)
If a factor is
found for an exponent, it's eliminated from further testing
Stefan Struiker wrote:
Zdrastie!
Where would I look to find 65-bit factors found during "Factor=" Trial
Factoring? I see that P-1 Factoring has turned up some absolute whoppers!
Best Wishes,
Stefanovic
I don't know what to tell you. One of the current weaknesses in
PrimeNet is that
For those unaware of this PrimeNet feature:
To extend an assignment or assignments up to 120 days, see:
http://www.mersenne.org/ips/manualtests.html
"Extend Exponent Assignments" toward the bottom of the page!
Best Wishes,
Stefanovic
It should possibly be added that one does not
Bruce A Metcalf wrote:
At 08:13 AM 7/26/00 -0700, Bob Margulies wrote:
I have just finished a case (M9836773) and expected Prime 95 (version
20.6, running under Win 98) to begin another. Instead I have the message
"This program has performed an illegal operation and will be shut down."
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
Jeramy Ross wrote:
This 'Wonderful' compression technology maybe "Awesome"; however, MY main
objection or perhaps philosophy towards all of this is that Prime95 is
not a large
piece of code. It takes a relatively small amount of time to download over
a modem
compared to other
I can see something like this being worth it for a very large executable
- this summer, I was forced to download the Sun JDK over a 56k modem.
It wasn't fun.
However, the question we must consider is whether saving space in a
1-meg executable is worth the extra trouble for all concerned, as
Paul Leyland wrote:
We could let prime95 decide the next election grin.
Give everybody a different prime number. Multiply the primes for
candidate A together, likewise for B.
And like in this election, unless we can completely factor
the results,
we wouldn't know who won,
Well, unless there is an announcement within the next few hours, 2000
will be the first calender year in the history of GIMPS without a
Mersenne prime.
Is the number of searchers, and the power of their hardware, increasing
enough to keep up with the increased runtimes and (slightly) decreased
Hi,
I was wondering if anyone knows of a script to shut down mprime and make
sure the save files are finished saving before SIGKILL is sent in the
shutdown process.
In terms of starting it up, I now have a line in my inittab file to
start it whenever the system enters runlevel 5, and run it
Jeff Woods wrote:
At 04:48 PM 2/3/01 -0500, you wrote:
After hanging around the Anandtech DC forum for awhile, I'm convinced
that this completion time "problem" might be GIMPS biggest hurdle to
getting more participation. Very few "loonies" like us are willing
to wait 14 months for
Alexander Kruppa wrote:
"Brian J. Beesley" wrote:
Some people have indicated they'd like a version of the program with
a pretty screen-saver interface. Fair enough, provided we can keep
the "classic" version without the extra overhead.
The screen-saver idea is important for another
Ken Kriesel wrote:
At 09:23 AM 2/3/2001 -, "Brian J. Beesley" [EMAIL PROTECTED] wrote:
George has announced the development of new FFT code optimised for
Pentium 4. The FFT code is the true heart of the program: it's really
hard for me to put into words just how much we all owe to
On Fri, 09 Feb 2001 17:56:26 EST, you wrote:
Just my 2 cents' worth with respect to the screen saver
proposals: how about the following?
1) (This is along the lines of the popular "swarm of
bees" screensaver) Have some bee (or other - perhaps
allow the user to choose from a menu) icons move
Let's assume that the P4 is, as George estimates, capable of doing the
512K FFT at 0.04 iterations per second.
In this case, with some back-of-the-envelope calculations, I estimate
that a thousand P4s (which might well be on PrimeNet in a year, or a
little more - the P4 is approaching the
Jud, you wrote:
I wonder how many people are going to have P4s. Presently, the Athlon is
faster for most things, and cheaper. I don't know if the P4 will pull
ahead of AMD chips for most things, so will people buy them?
My understanding is that they are designed to perform well for
On Mon, 12 Feb 2001 13:29:01 -0500, you wrote:
This frankly makes me wonder how much longer there will be a place in
GIMPS for slower machines. I'm not saying that's a bad thing - after
all, 486s and original pentiums were the workforce when GIMPS began,
and I wouldn't feel comfortable with the
On Sat, 17 Feb 2001 14:42:17 -0800, you wrote:
This is mildly amusing.
http://radified.com/Overclocking/oldest_overclocker.htm
read the text below the picture, specifically, the 3rd paragraph :)
-jrp
This reminded me of a discussion I had with a friend. He mentioned he
used SETI:
"Ever
On Sun, 18 Feb 2001 02:24:36 -0600, you wrote:
I for one found my way to the Prime95 project through overclocking. In the
OCing community Prime95 has been considered the single best stress test
tool available for some time now (especially when used in conjunction with
a game that makes heavy
On Sun, 18 Feb 2001 07:02:09 -, Brian Beesley wrote:
I know what you mean ... but the fact is there's no such thing as
_bad_ publicity.
True enough.
However I do wonder how much of the recycling of expired exponents is
due to people picking up Prime95 just to run a hardware test. The
a 300 MHz PII
takes about half as long to run as a typical LL assignment on a 1.2
GHz Athlon. Personally I don't feel this is unreasonable.
Of course, the 1.2 Ghx Athlon is right at the top of the "state of the
art", while systems well slower than a PII are stil
On Sun, 18 Feb 2001 13:31:50 -0500, Jud McCranie wrote:
I've edited my WorkToDo file to put the tests in order so that the ones
that take the least time will be done first. Will my doing this mess
anything up?
Not to my knowledge. The one thing to be careful of, however, is that
if you have
On Sun, 11 Mar 2001 12:03:47 -0500, Joshua Zelinsky wrote:
The vast majority of computers still aren't doing any form of distributed
computing. Here are a few suggestions to help increase GIMPS participation:
1. Get people at major universities + colleges to become "active
recruiters,"
On Sun, 11 Mar 2001 23:32:03 +0100, Martijn Kruithof wrote:
I have verified the possibility of a buffer overflow exploit in primenet.c
(used in linuxs mprime)
It seems NOT vurneralbe (so it seems safe to me)
NO buffer overflow is likely to occur.
Notwithstanding I am running mprime as user
. However many laptops appear to turn on an extra
cooling fan almost immediately a program which makes use of the FPU
starts.
My desktop does the same - the sound changes noticably when a
distributed computing program is running.
Nathan Russell
Hi all,
I have noticed significantly better Prime95 times here at school than I
did at home. On a hunch, I checked the hardware lists on the web, and I
have what by all accounts is a software modem.
Both to get the Prime95 times at home back up, and since I plan to put
on a dual boot, I
Hi Dave,
You wrote:
I am running Windows98 on a Pentium computer.
Recently, Prime95 started running at 8 seconds per iteration.
When I killed process Alogserv, it went back to running at
.28 seconds per iteration. What is this process, and how do I
get rid of it? Thanks.
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Tue, 20 Mar 2001 14:17:02 -0500, George Woltman wrote:
Hi all,
As promised, the server now has about 1000 small exponents
to give out for triple-checks.
Out of curiousity, am I the only one who, while running triple-checks
by arrangement
ddenly start selling videotapes for the Betamax VCR.
Regards
Brian Beesley
Nathan Russell
-BEGIN PGP SIGNATURE-
Version: PGPfreeware 6.5.8 for non-commercial use http://www.pgp.com
iQA/AwUBOrfq1IvPBwdDF2xqEQKDdgCeJhTSRtZD3bW+im46//1Ye7hkmCcAoL4n
PFTvO4XgT1LaUfvTuSG+RBP4
=MQax
--
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wed, 21 Mar 2001 19:57:13 +0100, Steiner wrote:
Now, I wonder what this juno.com _is_... and how they possibly could
get anybody to accept that. Looking at their pages, they look like
an ISP -- but how could possibly their Internet connection be
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Sun, 25 Mar 2001 19:09:02 +0200, Steiner wrote:
On Sun, Mar 25, 2001 at 10:03:01AM -0500, Pierre Abbat wrote:
How does idle time accrue *to a process*? Idle time is when the CPU
is not executing any process.
Just like the brain, your computer
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wed, 21 Mar 2001 22:10:06 -, Brian J. Beesley wrote (re gray
bits):
This is an example of the sort of "copy protection" I find
acceptable, because I can make as many perfect copies as I like for
my own use; nonetheless the copies can be
-BEGIN PGP SIGNED MESSAGE-
Hash: SHA1
On Wed, 21 Mar 2001 18:12:49 -, Brian J. Beesley wrote:
On 20 Mar 2001, at 18:42, Nathan Russell wrote:
Slashdot takes a particular interest in this program because many
of their editors and members believe that CSS is an infringment
On Saturday 31 March 2001 03:09, Brian J. Beesley wrote:
On 30 Mar 2001, at 15:53, [EMAIL PROTECTED] wrote:
processes are running. However, under Solaris, something
run at priority 19 still tends to get a
not-insignificant share of CPU time - a typical number
is 15% on a system with one
Regards,
Tobias
Nathan Russell
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
On Tuesday 10 April 2001 14:20, you wrote:
Hi and thank you mr Leyland for the reply
I have another question. If you are doing ECM factoring on a Fermat number
with prime95 should you check the "Factor 2^N+1" box, since "Every factor
of a Fermat number fermat(n) has the form 2^(n+2) * k +
On Mon, 16 Apr 2001 18:53:33 +0200, Martijn Kruithof wrote:
Hello,
if that what you describe is the problem the solution is obvious
If a client checked out an (set of) exponent(s) and has not returned it yet
just re-assign that same (set of) exponent(s).
The problem is that the two machines
On Mon, 16 Apr 2001 19:40:41 US/Eastern, [EMAIL PROTECTED]
wrote:
NO Mail lately, just wanted to know if the list is
active!
We're here, all right!
Nathan
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
On Tue, 17 Apr 2001 17:49:49 -0700, Aaron Blosser wrote:
"Should I be worried about Juno downloading data and software to my
computer?"
No. Juno has been downloading data and software to your computer since
the
day you first subscribed.
Gotta give 'em credit for being honest.
Dang, I
On Tue, 17 Apr 2001 19:25:45 -0400, Vincent Mooney wrote:
Someone on this list earlier warned about Juno using subscriber's
computers. Here is a portion of the current Juno Virtual Supercomputer
Project data.
(BIG snip)
No. Juno has been downloading data and software to your computer since
On Tue, 17 Apr 2001 20:25:04 -0700, Aaron Blosser wrote:
From time to time, we also download new versions of the Juno software to
bring your version up to date, and we expect to download new scientific
software from time to time as part of the Juno Virtual Supercomputer
Project.
NO mention
On Fri, 20 Apr 2001 14:15:13 -0700, Aaron Blosser wrote:
perhaps just have Prime95 update some SNMP counters... I think it'd be
"neato" to use MRTG to track various counters of the machines I have running
Prime95/NTPrime. Then you're just offloading the task of doing charts and
stuff to some
I just posted an article on one of my favorite discussion boards,
known as Half-Empty, about distributed computing, asking people on the
site to vote for, and post comments about, their favorite project.
http://www.half-empty.org/servlet/LoadPage?pageID=ideaideaid=1644sortmode=3viewmode=3
I
(Sprry Spike, I mistyped the list address the first time on the copy i
sent to you)
On Sun, 22 Apr 2001 20:37:11 -0700, Spike Jones wrote:
Nathan Russell wrote:
http://www.half-empty.org/servlet/LoadPage?pageID=ideaideaid=1644sortmode=3viewmode=3
I thought the prime community might want
On Thu, 26 Apr 2001 06:34:07 +0200 (MET DST), Hans Riesel wrote:
Hi everybody,
If 2^p-1 is known to be composite with no factor known, then so is
2^(2^p-1)-1.
For that matter, the same argument can be made with regard to
2^(2^R-1)-2 for some RSA factoring challange number R, and probably
1 - 100 of 166 matches
Mail list logo
