All,
Here is version 1.1 of the FAQ.
I corrected a few typos. I then added 500 more of them when I added the LL
section. The LL section needs major revision, and clarification, especially
the repeating LL part. I think we might add a section on FFT, and DWT, though
I don't know enough about
At 04:16 AM 6/29/99 -0400, Lucas Wiman wrote:
All,
Here is version 1.1 of the FAQ.
Here's a question that needs to be addressed: how to go from digits to
exponents, and exponent to digits.
+--+
| Jud "program first and think later" McCranie |
At 04:16 AM 6/29/99 -0400, Lucas Wiman wrote:
All,
Here is version 1.1 of the FAQ.
Also. FAQs involve why do we think there are an infinite number of Mersenne
primes, how many are expected below a given limit, and what s the probability
of finding one.
On Mon, Jun 28, 1999 at 11:03:26PM -0400, David A. Miller wrote:
If there is a way for the user to control the
amount of factoring, then it is news to me.
It's in the `Advanced/Factor' menu choice. mprime hasn't got this option,
but I haven't bothered to send in a bug report.
/* Steinar */
On Tue, Jun 29, 1999 at 04:16:19AM -0400, Lucas Wiman wrote:
I corrected a few typos. I then added 500 more of them when I added the LL
section. The LL section needs major revision, and clarification, especially
the repeating LL part.
But it still is nice!! Good work. Let us never ever see the
The 10,000,000 digit prime would have an exponent of over
3010299.956, or 3010300
which is found by taking (log 2 * 10,000,000)
Actually, it's log10(2) * 10,000,000, which is a different number. Of
course, since I'm not at home, I can't figure out _that_ number offhand,
but see the posts
Mersenne Digest Tuesday, June 29 1999 Volume 01 : Number 590
--
Date: Sun, 27 Jun 1999 22:32:01 -0400
From: "Rick Pali" [EMAIL PROTECTED]
Subject: RE: Mersenne: M38 in the news
From: Luke Welsh
I'm keeping my fingers, toes and hairs crossed :-) Just too bad nobody
else has participated in my guess-contest... That means I will be the
sole winner! Hooray!
Then, later:
Hmmm, my guess was at about 6,2 million, but nobody else guessed,
so there :-)
Sorry, but I _also_ submitted a guess for
At 11:17 PM 6/29/99 +0200, Steinar H. Gunderson wrote:
Then what is the best fit? Exponential? :-)
It is slightly parabolic. The good news is that it is trending upward faster
than linearly.
+--+
| Jud "program first and think later" McCranie |
Aaron Blosser wrote:
~ expressions just look much cooler if you throw in a pi
Hmm...
pi pi pi pi pi pi
( + + ) ** ( + ) +
pi pi pi pi pi pi
Date: Mon, 28 Jun 1999 19:45:11 -0700
From: Eric Hahn [EMAIL PROTECTED]>
Subject: RE: Mersenne: A few questions
>How large will the exponent be for a 10,000,000 digit prime number?
To be a 10,000,000 digit prime number the exponent must be at least
33,219,281 (which also happens to be a Mersenne
>>>Has the prime number that was found a week ago been announced on
>>>this list?
>>>I.E. What number was it?
>>It hasn't been announced yet... but from what little information
>>that is available, i.e. The Oregonian newspaper article, the
>>exponent must be =at least= 6,643,859.
>>Eric
Make my guess for M38, p~=6,740,000
Ken
Unsubscribe list info -- http://www.scruz.net/~luke/signup.htm
13 matches
Mail list logo
