Hi,
the Lucas-Lehmer iteration
L_0 = 4
L_{n+1} = L_n ^2 -2
looks suspiciously like an iteration used in Pollard-Rho:
x_0 = a
x_{n+1} = x_n ^2 +b
Can this be used to do a LL test and Pollard-rho factoring attempt at
once?
I remember faintly having read something that b=-2 is not a good choice
Eric Hahn wrote:
I'm looking for program(s) capable of trial-factoring
prime exponent Mersenne numbers (using 2kp+1) meeting
the following requirements:
[factors and exponents of arbitrary size]
mersfacgmp from the Will Edgingtons mers package uses gmp's mpz type for
factors (thus the
Eric Hahn writes:
I'm looking for program(s) capable of trial-factoring
prime exponent Mersenne numbers (using 2kp+1) meeting
the following requirements:
1) Capable of trial-factoring any exponent 1
(at least to some considerably large number,
say 1 trillion?)
If
I think it's about time we find a new prime...
The list is so quiet now.
:)
/Lars
_
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
Mersenne Prime FAQ -- http://www.tasam.com/~lrwiman/FAQ-mers
Jason Stratos Papadopoulos wrote:
On Thu, 28 Oct 1999, Alexander Kruppa wrote:
Hi,
the Lucas-Lehmer iteration [...]
looks suspiciously like an iteration used in Pollard-Rho: [...]
Can this be used to do a LL test and Pollard-rho factoring attempt at
once?
Except that every
Alexander Kruppa [EMAIL PROTECTED] observes:
Hi,
the Lucas-Lehmer iteration
L_0 = 4
L_{n+1} = L_n ^2 -2
looks suspiciously like an iteration used in Pollard-Rho:
x_0 = a
x_{n+1} = x_n ^2 +b
Can this be used to do a LL test and Pollard-rho factoring attempt at
once?
I remember
but doing the Pollard-Rho along a LL test would not
be particularly efficient, anyways.
Or particularly successful. Remember Pollard-rho heuristically expects to find a
factor p in something along the lines of sqrt(p) iterations. Since we're doing lets
call it 10^7 iterations, you'd
On Thu, Oct 28, 1999 at 05:12:46PM +0200, Lars Lindley wrote:
I think it's about time we find a new prime...
The list is so quiet now.
I'm working on it! ;-)
I think a quiet list is better than a list in rage -- don't try
to start a poaching war again, please... The list isn't that
quiet
Dear All:
Just a friendly reminder that the second not-quite annual Great Internet
Mersenne Prime Search OktoberGeekfest get-together-kind-of-deal is set
for tomorrow evening.
What: GrOGfest '99
Where: Tied House, Mountain View, California USA
When: Friday, 28. October, beginning at 6:30 pm PDT
Alex Kruppa wrote:
Can this be used to do a LL test and Pollard-rho factoring attempt at
once?
Jason Papadopoulos wrote:
Except that every once in a while you'd have to perform a GCD, and
a GCD on million-digit size numbers takes about a day (no kidding!
There seems to be no fast way to
Mersenne Digest Thursday, October 28 1999 Volume 01 : Number 653
--
Date: Tue, 26 Oct 1999 12:18:46 -0400 (EDT)
From: Darxus [EMAIL PROTECTED]
Subject: Re: Mersenne: mprime startup at boot-time
On Thu, 21 Oct
But if I were to be sprayed with beer by Knuth I would consider it
the greatest day of my life! If I were to see him I fear I would fall
prostrate upon the earth, crying "Im unworthy! I sck!"
{8^D spike
(: .oot gniddik m'I)
[EMAIL PROTECTED] wrote:
I wanted to invite Don Knuth,
"Blosser, Jeremy" wrote:
Seeing as how the Sega Dreamcast was officially released here in the
U.S.
today... and the list has been REALLY quiet (due to school starting?),
I
looked at the specs... and sure 'nuff, apparently, the Hitachi SH4 can
do 2
FPU ops per cycle (single or double
I've updated my web pages Yet Again, including adding some quick links
at the top of mersenne.html to the other Mersenne related files on my
web site.
The 1stfacnt.txt file is gone; I've split it into facntHU.txt (for
incompletely factored Mersennes) and facntD.txt (for completely
factored
14 matches
Mail list logo
