AIL PROTECTED]>
Sent: Tuesday, October 12, 1999 8:33 PM
Subject: Re: probability of primeness (was: Re: Mersenne: splitting up 10m
digit primes)
> On Tue, Oct 12, 1999 at 10:53:18PM -0400, Darxus wrote:
> >
> > I'm hoping what I have to say in this email might be importan
> > I think trial factoring is done to 2^68 for an exponent around 33 million.
> > Thus your chance is 2 * 68 / 3300.
>
> Okay, so as far as we know, each number is equally likely to be prime, and
> this probability is just based on how much has already been tested ?
Umm, no. The probabilit
On Tue, Oct 12, 1999 at 10:53:18PM -0400, Darxus wrote:
>
> I'm hoping what I have to say in this email might be important.
>
> On Tue, 12 Oct 1999, George Woltman wrote:
>
> > At 04:12 PM 10/12/99 -0400, you wrote:
> > >> >And how is the probability of finding a prime calculated ?
> > >>
> >
As I posted some days back;
Anyone who wants to quit an exponent after investing a PII-400-month or
more, please contact me, and we'll try to carry it on, using it for the
QA effort.
It could take some major bandwidth-minutes if more than a few exponents
are quit, however.
Ken
At 04:15 PM 19
On Tue, 12 Oct 1999, Rick Pali wrote:
> From: [EMAIL PROTECTED]
>
> > How about an option when you hit "QUIT GIMPS" to
> > upload your P and Q files to Primenet, so someone
> > can at least finish the job?
>
> I'm running an exponent in the 33 million area and the save-files are over
> seven me
> > There is now a prize for factoring Fermat numbers too.
>
> Neat. Where's the info ?
I think Richard Crandall is offering a prize for Fermat factors
(http://www.perfsci.com). John Selfridge is also anouncing a prize
for factors of various numbers which "ought to be prime". I don't
think th
From: [EMAIL PROTECTED]
> How about an option when you hit "QUIT GIMPS" to
> upload your P and Q files to Primenet, so someone
> can at least finish the job?
I'm running an exponent in the 33 million area and the save-files are over
seven megabytes in size! That would require no small amount of
In a message dated Tue, 12 Oct 1999 2:16:30 PM Eastern Daylight Time, Jeff Woods
<[EMAIL PROTECTED]> writes:
> If you tried to "break them up", with, say, 100,000 "iterations" per user,
> then the person with 100,001 through 200,000 cannot even start 100,001
> until all 100,000 iterations of
On Tue, 12 Oct 1999, George Woltman wrote:
> I admire your patience!
Thank you :)
> > I think it said 1 in 250,000 chance if finding
> >a prime. So.. on average, it would probably take that one computer, by
> >itself, 241,250 years to find a 10m digit prime. Right ?
>
> Define "probably".
At 11:00 AM 10/12/99 -0400, you wrote:
>I'm okay with that. But I think, if possible, it'd be good to break up
>primes into like, 1 month chunks, & distribute them. I'm sure it'd be
>possible, I just don't know if/how much it'd impact speed.
Not possible. Well, POSSIBLE, but it would actually
Hi,
At 11:00 AM 10/12/99 -0400, Darxus wrote:
>704.5 days to go on this 10m digit prime my computer at home is working
>on. P2 233. 1.93 years.
I admire your patience!
> I think it said 1 in 250,000 chance if finding
>a prime. So.. on average, it would probably take that one computer, by
>i
11 matches
Mail list logo
