Brian Beesley wrote:
On 27 Oct 99, at 17:23, Eric Hahn wrote:
I'm looking for program(s) capable of trial-factoring
prime exponent Mersenne numbers (using 2kp+1) meeting
the following requirements:
[...requirements...]
Well, I'm prepared to have a go. Could we tighten up the spec a bit?
On 27 Oct 99, at 17:23, Eric Hahn wrote:
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
Well, I'm prepared to have a go. Could we tighten up the spec a bit?
(a) There's also been some interest in something else that Prime95
doesn't do - trial factoring 2^p+1.
(Note that this form also form also has factors of the form k*p+1.)
(b) I assume we're only interested in 2kp+1
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'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?)
As I recall, Brian [Beesley] mentioned
