Hi, I need some help.
I would like to look for a factor of a mersenne prime in a specific area.
For example, for a mersenne exponent of say 40,000,000. I want to use the
Prime95b program, (v19 I guess), to search for a factor in a specific range
from, say, 2^40 to 2^50. I do not understand the
Hi all,
At several users request I've uploaded factoring data for all exponents
below 79,300,000. You'll need a special decompression program I wrote.
See http://www.mersenne.org/status.htm for details.
Regards,
George
_
I would like to look for a factor of a mersenne prime in a specific area.
For example, for a mersenne exponent of say 40,000,000. I want to use the
Prime95b program, (v19 I guess), to search for a factor in a specific range
from, say, 2^40 to 2^50. I do not understand the ECM factoring
On Fri, Oct 01, 1999 at 04:15:27PM -0600, Aaron Blosser wrote:
Hmm...no kidding. Now, correct me if I'm wrong (I probably am) but aren't
those types of encryption schemes based on multiplying large primes together
to generate the "key", and the fact that it would take a VERY long time to
factor
When this is cleared up, it will make a good FAQ.
Who maintains the FAQ list? Do you agree the answer here is a good FAQ?
At 01:10 PM 10/2/99 -0700, you wrote:
Hi, I need some help.
I would like to look for a factor of a mersenne prime in a specific area.
For example, for a mersenne exponent
Sorry
But.
Why do primality tests run to the full value of the integerFor any
iteration surely if an exponent is found within the test it should be
reported and the program aborted?.Not being a maths buff...
Perhaps I should not be on this list...
p.s. The Proth prime site was even more
When this is cleared up, it will make a good FAQ.
Who maintains the FAQ list? Do you agree the answer here is a good FAQ?
I would like to look for a factor of a mersenne prime in a specific area.
For example, for a mersenne exponent of say 40,000,000. I want to use the
Prime95b
