On Tue, 12 Oct 1999, Jukka Santala wrote:
Is it just me, or does factoring smaller Mersenne numbers take
propotionally much longer? I would expect M727 to be much faster than
the 33M range to a fixed depth, yet the opposite _seems_ to be true.
It's not just you, it's a natural consequence of
On Mon, Oct 11, 1999 at 12:06:07PM -0500, jason wrote:
Well, I also downloaded mprime.tar.gz, and I had a slightly different
problem trying to connect to the PrimeNet server. To summarize:
mprime.tar.gz v19.0.2: results in "ERROR: Primenet error 1"
sprime.tar.gz v19.0.2: results in
At 11:00 AM 10/12/99 -0400, you wrote:
I'm okay with that. But I think, if possible, it'd be good to break up
primes into like, 1 month chunks, distribute them. I'm sure it'd be
possible, I just don't know if/how much it'd impact speed.
Not possible. Well, POSSIBLE, but it would actually
George Woltman wrote:
Since factors are of the form 2kp+1 there are many more factors to test
when you factoring M727. Yes each factor can be tested in less time,
but this is overwhelmed by extra factors to test.
Thanks to everybody pointing this one out, I missed the obivious
implication
"Brian J. Beesley" wrote:
// Regarding factoring Mersennes to v19 depth...
If you do decide to do this, you're on your own - don't be surprised
if someone else does the same thing independently - there's no
mechanism for coordination to avoid wasted effort.
Partially. There now exists
On Tue, 12 Oct 1999, George Woltman wrote:
I admire your patience!
Thank you :)
I think it said 1 in 250,000 chance if finding
a prime. So.. on average, it would probably take that one computer, by
itself, 241,250 years to find a 10m digit prime. Right ?
Define "probably". 241,250
From: [EMAIL PROTECTED]
How about an option when you hit "QUIT GIMPS" to
upload your P and Q files to Primenet, so someone
can at least finish the job?
I'm running an exponent in the 33 million area and the save-files are over
seven megabytes in size! That would require no small amount of
There is now a prize for factoring Fermat numbers too.
Neat. Where's the info ?
I think Richard Crandall is offering a prize for Fermat factors
(http://www.perfsci.com). John Selfridge is also anouncing a prize
for factors of various numbers which "ought to be prime". I don't
think that
On Mon, Oct 11, 1999 at 10:10:04PM +0100, Brian J. Beesley wrote:
Windows users might care to try a nice program called CyberKit, which
is freeware does ping, traceroute NS lookup (amongst other
things).
I don't know if Windows does `other things', but it certainly has
ping (ping) and
Jukka Santala wrote:
Is it just me, or does factoring smaller Mersenne numbers take
propotionally much longer? I would expect M727 to be much faster
than the 33M range to a fixed depth, yet the opposite _seems_ to
be true.
For any given factoring bit-depth, larger exponents will take
a shorter
On Tue, 12 Oct 1999, Rick Pali wrote:
From: [EMAIL PROTECTED]
How about an option when you hit "QUIT GIMPS" to
upload your P and Q files to Primenet, so someone
can at least finish the job?
I'm running an exponent in the 33 million area and the save-files are over
seven megabytes in
[ Joth Tupper explained] ...why we cannot stop in the "middle"
of a Lucas-Lehmer test. The essential answer is that we
know a property of particular terms in the sequence 4, 14, 192...
given recursively by squaring and subtracting 2
I understand this now, but I didnt when I first
Anyway, still waiting to hear if ECM will,
eventually, find all factors or if it leaves "factors" in the range...
The best way of thinking about this is that each curve at a given bound has
a small but non-zero probability of finding a factor of a certain length,
assuming that one exists.
Is there a copy (preferably unformatted plaintext) of the decimal
expansion of the largest (2million-some digits) prime, gzipped or zipped
or something, somewhere ?
Anybody know how long it takes to calculate this using the calc program
(which I'm currently compiling for this purpose) ?
I
On Tue, 12 Oct 1999, Steinar H. Gunderson wrote:
On Mon, Oct 11, 1999 at 10:10:04PM +0100, Brian J. Beesley wrote:
Windows users might care to try a nice program called CyberKit, which
is freeware does ping, traceroute NS lookup (amongst other
things).
I don't know if Windows does
As I posted some days back;
Anyone who wants to quit an exponent after investing a PII-400-month or
more, please contact me, and we'll try to carry it on, using it for the
QA effort.
It could take some major bandwidth-minutes if more than a few exponents
are quit, however.
Ken
At 04:15 PM
On Tue, Oct 12, 1999 at 10:53:18PM -0400, Darxus wrote:
I'm hoping what I have to say in this email might be important.
On Tue, 12 Oct 1999, George Woltman wrote:
At 04:12 PM 10/12/99 -0400, you wrote:
And how is the probability of finding a prime calculated ?
It is roughly
At 12:03 PM 1999/10/12 -0400, Jud McCranie [EMAIL PROTECTED]
wrote:
At 12:54 PM 10/12/99 +1000, Simon Burge wrote:
"John R Pierce" wrote:
a year on one of these [a vax] wouldn't equal one day on a pentium-II.
Probably a bit generous there even, given that older vaxen wouldn't
have pipelined
I think trial factoring is done to 2^68 for an exponent around 33 million.
Thus your chance is 2 * 68 / 3300.
Okay, so as far as we know, each number is equally likely to be prime, and
this probability is just based on how much has already been tested ?
Umm, no. The probability that
Is there a copy (preferably unformatted plaintext) of the decimal
expansion of the largest (2million-some digits) prime, gzipped or zipped
or something, somewhere ?
Yes! Landon Curt Noll has all the Mersenne primes on his website.
Mersenne Digest Tuesday, October 12 1999 Volume 01 : Number 641
--
Date: Tue, 12 Oct 1999 12:54:34 +1000
From: Simon Burge [EMAIL PROTECTED]
Subject: Re: Mersenne: Re: GIMPS
"John R Pierce" wrote:
a year on
21 matches
Mail list logo
