> Darxus wrote:
>
> > I've put a graph of these "pairs" up on my web page.
> > http://www.op.net/~darxus/p_pairs.bmp
>
> Never use BMP on the WWW, please!
> There's no way for me to look at that.
here, I whacked it for you...
http://hogranch.com/files/Bitmaps/p_pairs.gif
since it was a very-few
"Brian J. Beesley" wrote:
> On 14 Oct 99, at 18:15, Chris Jefferson wrote:
> Surely this isn't really an issue. PrimeNet would surely recognise a
> result submitted by a "poacher" as such & either disqualify it
> automatically, or credit the actual owner of the assignment instead
> of the "poache
Darxus wrote:
> I've put a graph of these "pairs" up on my web page.
> http://www.op.net/~darxus/p_pairs.bmp
Never use BMP on the WWW, please!
There's no way for me to look at that.
-Donwulff
_
Unsubscribe & list info -- http://w
[EMAIL PROTECTED] wrote:
> Hello, everybody. As usual I'm quoting different people. Disturbingly, I
> noticed a weird HTML tag on my last E-mail. I can assure you I didn't put it
> there, and don't know why my software's acting up on me (because I've never
> seen that jibberish before). HTML mail
Joth Tupper wrote:
> The size of the files is an issue. With interim result files in the 7MB to
> 10MB range, some ISPs just cannot handle the size.
We're talking about "the program" here, there's no reason to stick with e-mail -
and in fact it's just an encumbrance. (Well, beyond that being s
> >> Linux is smarter -- it automaticaly gives preference for the last CPU
> >> used, without any special settings. Sometimes, however, if for some
> >> reason the kernel or other threads need that specific CPU, Linux will
> >> move the process. You win.
> > Actually, NT does the same thing.
>
>
> > Personally, I think the big problem with regards to this is not people
> > quitting so much as the possibility of major hard-drive failure etc. on the
> > testers. I doubt many of them keep good backups
>
> NO EXCUSE! A Zip drive or a CD-R is inexpensive and effective; one
> will service ma
>
So constants don't matter, of course.
<>
Nod, that's what I was aiming for. I wasn't trying to prove Wagstaff wrong -
just find a closer way to estimate M(x). At least the ~ means that adding a
constant doesn't change f(x)/g(x) = 1 as x -> infinity... right? (See, if
something t
> < Lenstra, Pomerance, and Wagstaff all believe this [an early conjecture by
> Gillies] and in fact suggest that ?? M(x) ~ e^gamma log x ?? where the log
> is to base 2.>>
> Hence, my new conjecture:
> ?? M(x) ~ e^gamma log[2] (x) + C ??
>
> Of course, I used 1.4615 to make my 3 conjectures
On 14 Oct 99, at 18:37, Jukka Santala wrote:
> Personally, I think the big problem with regards to this is not people
> quitting so much as the possibility of major hard-drive failure etc. on the
> testers. I doubt many of them keep good backups
NO EXCUSE! A Zip drive or a CD-R is inexpensive a
On 14 Oct 99, at 18:15, Chris Jefferson wrote:
> > Also one would have to ask what would be the incencitive for someone to act
> > as a backup server... or prevent them from "stealing the work" as it were, by
> > using high-speed computers to finish the test a month before the main person
> > doe
I've put a graph of these "pairs" up on my web page.
http://www.op.net/~darxus/p_pairs.bmp
Numbering each P by the order in which they were discovered (and omitting
#38), I put the even numbers on 1 line, and the odd numbers on a seperate
line, and added 1 to the beginning of the evens to get th
> Conjecture time: The prime number earning the $150K prize will not be a
> Mersenne.
This isn't so much a conjecture as a prediction (there is a difference).
A conjecture is a very specialized prediction.
> Why do I say that? Even with processor speeds increasing, we have a good
> idea how lo
Hello, everybody. As usual I'm quoting different people. Disturbingly, I
noticed a weird HTML tag on my last E-mail. I can assure you I didn't put it
there, and don't know why my software's acting up on me (because I've never
seen that jibberish before). HTML mail is evil, only second to MIME.
On Thu, Oct 14, 1999 at 06:15:52PM +0100, Chris Jefferson wrote:
>In my personal opinion, the best way of doing this would be to set up 3
>computers in a 'loop' all doing the same exponent. Then they could
>communicate at regular intervals.
We are already doing this manually, although only with 2
Mersenne DigestFriday, October 15 1999Volume 01 : Number 644
--
Date: Thu, 14 Oct 1999 21:39:15 -0500
From: Ken Kriesel <[EMAIL PROTECTED]>
Subject: Re: Mersenne: # of digits in 2^p-1
Look it up in the FAQ l
On 15 Oct 99, at 18:25, Chris Jefferson wrote:
> Just something I was pondering a couple of days ago...
>
> Consider a general number (odd) number c which can be factored into ab=c
>
> W.L.O.G. assume b is greater than a
>
> then let x=(a+b)/2 , y=(b-a)/2
>
> then (x+y)(x-y)=c
>
> x^2 - y^2
At 06:25 PM 10/15/99 +0100, Chris Jefferson wrote:
Consider a general number (odd) number c which can be factored into ab=c
>W.L.O.G. assume b is greater than a
>
>then let x=(a+b)/2 , y=(b-a)/2
>
>then (x+y)(x-y)=c
>
>x^2 - y^2 = c
>
>x^2 = c + y^2
>
>So if we can find if this equation has any i
Hi!
Just something I was pondering a couple of days ago...
Consider a general number (odd) number c which can be factored into ab=c
W.L.O.G. assume b is greater than a
then let x=(a+b)/2 , y=(b-a)/2
then (x+y)(x-y)=c
x^2 - y^2 = c
x^2 = c + y^2
So if we can find if this equation has any in
On 15 Oct 99, at 13:16, Michael Oates wrote:
> I am also having the same problem, but only on one machine, I have 9 others
> that are fine, all are using the same version of v19 beta 4
What's different? Must be _something_ ...
>
> I click on Test | PrimeNet... then tick the box "Send new comple
>> Linux is smarter -- it automaticaly gives preference for the last CPU
>> used, without any special settings. Sometimes, however, if for some
>> reason the kernel or other threads need that specific CPU, Linux will
>> move the process. You win.
> Actually, NT does the same thing.
Nope. You s
> Linux is smarter -- it automaticaly gives preference for the last CPU
> used, without any special settings. Sometimes, however, if for some
> reason the kernel or other threads need that specific CPU, Linux will
> move the process. You win.
Actually, NT does the same thing.
> Have you notice
Hi,
>Why don't you get the release version of v19?
Well that is of course what I will do when I get back to work. But I thought
it very strange that only one machine was behaving in this way.
>- Original Message -
>From: Michael Oates <[EMAIL PROTECTED]>
>To: <[EMAIL PROTECTED]>
>Sent:
Henrik,
Ah, but, it should be spooled because I have asked it send new completion
dates to PrimeNet. It does it on my other machines.
I will put the final version of v19 on and see if that works.
>On Fri, 15 Oct 1999, Michael Oates wrote:
>> I have checked that before I do the Manual Communicat
On Fri, 15 Oct 1999, Michael Oates wrote:
> I have checked that before I do the Manual Communication to see if the
> prime.spl was there... it was not !
prime.spl only ever exists when there is something to send to the server
and it hasn't been sent yet.
If it's not present, there is no communica
Hi,
At 06:47 AM 10/15/99 +0200, Shot wrote:
>The question is: why didn't Prime95 factor the older one from 63 to
>64?
No good reason. The program doesn't do any trial factoring once an LL test
has begun.
Regards,
George
_
Unsub
> I'd also guess that the skipped prime may have been pretty close to
> 2^5014947-1, and have a number of digits close to 1408773.
<...>
> Hmm... I just changed my worktodo.ini to Test=5014947,63 (where's the 63
> come from ? it was used for the last number I was assigned).
>
> It's saying "Error
I am also having the same problem, but only on one machine, I have 9 others
that are fine, all are using the same version of v19 beta 4
I click on Test | PrimeNet... then tick the box "Send new completion dates
to PrimeNet" Click ok, then go to Advanced | Manual Communication and click
ok. It con
Alot of the "hit" with multi processors depends on how the system is
designed. Especially the memory subsystem since you will go outside the L2
cache alot.
I'm still partial to Compaq's design, especially the more obscure things
like the ability to split IO requests across more than just one
pro
> --
>
> Date: Thu, 14 Oct 1999 20:44:16 -0400 (EDT)
> From: Darxus <[EMAIL PROTECTED]>
> Subject: Mersenne: types of work to request - 10m digit prime vs. next prime
>
> As soon as I heard that there was a $100,000 prize available for finding a
> prime, I decided t
30 matches
Mail list logo
