[EMAIL PROTECTED] writes:
How about the No Icon option? (You can still access it by trying to
run Prime95.exe again). And have it configured as a Win95
service. I'm not sure if my system is an anomaly, but even the
Three-Fingered Salute doesn't show Prime95 to be on the list of
ta
Geoffrey Faivre-Malloy writes:
M16384 has a factor:
3178457030898592746194675570663374420833971377365687459461386297851584459031
8073180374859604847822828243686877928403667633015295
Further, if you try to divide this into M8192 (2^8192 - 1), you should
find that it factors that as well
Geoffrey Faivre-Malloy writes:
I found another factor for Fermat 16. What do I do now? How can I
factor this number that I found? Are there programs out there that
will let me do that?
Yes, there are such programs. One is ecmfactor, a program I maintain
as part of the mers package
At 03:58 PM 6/26/99 -0400, Allan Menezes wrote:
>According to Paulo Ribenboim's book quoted below by Jud Euler's Constant
>gamma=0.577215665... and working out the number of mersenne primes below
>p=700
>in Mathematica 4.0 gives 39.5572 primes, so we must be missing a prime if
>Wagstaffs' rig
> Why test factor for primes in the range 2^1 to 2^10? If someone made the
> table I described, it is possible that all primes less than 2^10 are in the
> table I have described because they are known divisors of a Mersenne number
> OR are not candidates for dividing any Mersenne number by other
I may be a little obtuse here (and spelling, expression of ideas may be
inadequate) but
A Mersenne number's prime divisors are unique to that number. Letting a and
b be primes, 2^a - 1 and 2^b - 1 have completely different factors. So we
can make a table (database) with
p1 divides M(q1)
p2
>> P.P.S. Does anybody but Will care about these new factors?
>Heck yeah... keep 'em coming... a bit more discussion of how you're
>finding these things could be interesting, tho...
Well, that is probably the least interesting part. I use Will's
MersFacGMP program on a PII/233 running RedHat
On Sat, 26 Jun 1999 13:59:15 -0400, you wrote:
>I found another factor for Fermat 16. What do I do now? How can I factor
>this number that I found? Are there programs out there that will let me do
>that?
>
>FYI, the factor is:
>
>M16384 has a factor:
>317845703089859274619467557066337442083397
Here is the complete factorization of your number, directly from giantint.
As before, some of these factors may be composite.
3
* 5
* 17
* 257
* 641
* 65537
* 87596535553
* 12360473009170367279616001
* 6700417
* 26017793
* 63766529
* 190274191361
* 67280421310721
* 1256132134125569
* 596495891274
According to Paulo Ribenboim's book quoted below by Jud Euler's Constant
gamma=0.577215665... and working out the number of mersenne primes below p=700
in Mathematica 4.0 gives 39.5572 primes, so we must be missing a prime if
Wagstaffs' right.
Allan Menezes
Jud McCranie wrote:
> For those of
Mersenne DigestSaturday, June 26 1999Volume 01 : Number 588
--
Date: Thu, 24 Jun 1999 09:54:34 -0700
From: Paul Leyland <[EMAIL PROTECTED]>
Subject: RE: Mersenne: safe to defrag?
> From: Jud McCranie [mailto
I found another factor for Fermat 16. What do I do now? How can I factor
this number that I found? Are there programs out there that will let me do
that?
FYI, the factor is:
M16384 has a factor:
3178457030898592746194675570663374420833971377365687459461386297851584459031
807318037485960484782
For those of us who don't have access to Wagstaff's 1983 paper "Divisors of
Mersenne Numbers", it is nicely summarized in "The New Book of Prime Number
Records", by Paulo Ribenboim, chapter 6, section V.A. (page 411-413 in this
edition). He gives 3 statements:
(a) The number of Mersenne primes <
On 23 Jun 99, at 6:17, Brian J. Beesley wrote:
>
> On 22 Jun 99, at 17:38, Gary Diehl wrote:
> > 2. Why use a table at all? Is it faster than doing a calculation to
> > determine if [f % 255255] != 0 ? (I know sometimes tables can speed
> > things up, but does it really help with so few numbe
I have found 1868 new factors in the range of Brian's 10,000,000+ digits.
All of the other primes in this range have been tested through 2^47.
They are avalaible at:
http://www.tasam.com/~lrwiman/fact47
or
http://www.tasam.com/~lrwiman/fact47.gz
-Lucas Wiman
P.S. If these posts are getting anno
15 matches
Mail list logo
