Hi folks
Thanks for the "p-1 for dummies" e-mail.
But as everyone on this list knows, any factor of a Mersenne
number looks like 2*k*p+1 for N=2^p-1. Plugging this into
the above equation gives
q=2*k*p+1
q-1=2*k*p
Doesn't this mean the lower bound on a "p-1" method search
I used to really like distributed.net. The fact that they're still, to my
knowledge, only cracking encryption, and have not followed through on
their plans to do OGR primes, combined with the fact that their code is
not opensourced, bother me.
I've just switched to the GIMPS.
I have a
On Sat, Sep 18, 1999 at 03:01:43PM -0400, Darxus wrote:
I have a question though. Why make the Linux source dependant on code
which needs to be assembled under DOS, when there is an assembler for
Linux (as) ?
gas (which is the assembler Linux uses) uses a format quite differently
from NASM.
I have a question though. Why make the Linux source dependant on code
which needs to be assembled under DOS, when there is an assembler for
Linux (as) ?
Probably because of the hugely differing syntax and macro facilities. The
assembler code was originally written with MASM on a Microsoft
Hi,
At 03:01 PM 9/18/99 -0400, Darxus wrote:
I've just switched to the GIMPS.
Welcome aboard.
I have a question though. Why make the Linux source dependant on code
which needs to be assembled under DOS, when there is an assembler for
Linux (as) ?
There is a ton of assembly source code.
On Sat, 18 Sep 1999, Steinar H. Gunderson wrote:
On Sat, Sep 18, 1999 at 03:01:43PM -0400, Darxus wrote:
I would incourage you to release it under either
the GNU General Public License (http://www.gnu.org/copyleft/gpl.html), or
if you want to allow commercial use, the BSD license (which I'm
Did you do this with prime95 running, or stopped? If prime95 was
running, it wouldn't notice the change in worktodo.ini until the
next
iteration which is an exact multiple of 65536. Perhaps this
explains
what you saw.
I did it with prime95 stopped.
I have done this many times with v17 and
Ackk! That was rather inexact wording. Let me try again...my
Celeron 400 based systems crunch exponents in the 384K FFT range at about
the same speed as George's PII-400 machine. However, at the 448K FFT size,
George's machine appears to be 20% or more faster than my Celeron 400s.
Ackk! That was rather inexact wording. Let me try again...my
Celeron 400 based systems crunch exponents in the 384K FFT range at about
the same speed as George's PII-400 machine. However, at the 448K FFT size,
George's machine appears to be 20% or more faster than my Celeron 400s.
Ok,
I've come up with this SWAHBI (like a SWAG, but an idea
instead of a guess).
What I'm looking for is the following two items for *all*
Mersenne numbers 2^p-1 where p is prime and p1:
1) All known factors (including, but not limited to,
the smallest known factor (noted if it
10 matches
Mail list logo
