Is this group still active? I haven't been receiving any messages....
479
Phil Carmody
fatphil@...
Mar 4, 2001 8:06 pm
... It's alive, but by definition if not much is being posted, it s not "active", but unnecessary activity is just that, unnecessary. I certainly intend to do...
480
Milton Brown
miltbrown@...
Mar 5, 2001 1:06 am
Thanks Phil, I feel less lonely. I also am keeping (my computers) busy. And, they also have not had anything profound to say, recently. Milton...
481
Ñî ÊåÖÙ
yangshuzhong@...
Mar 5, 2001 7:12 am
who can give me a twin primes table below 1024 bits,or an address, thank you!...
482
Phil Carmody
fatphil@...
Mar 5, 2001 9:05 am
... Don't be fooled by the name, these only go up to 15 digits: http://www.meganumbers.com/ If you want anything larger, your best bet is to generate them...
483
Phil Carmody
fatphil@...
Mar 5, 2001 9:45 am
On Sun, 04 March 2001, Andy Steward wrote: [On the NMBRTHRY mailing list] ... Well done, Andy. Is UBasic as fast for this kind of job as C would be with one of...
484
joe.mclean@...
Mar 5, 2001 10:14 am
RE : Factoring. Two of the sites of most use for this sort of stuff are ; Will Edgington's page : http://www.garlic.com/~wedgingt/mersenne.html and Paul...
485
Paul Leyland
pleyland@...
Mar 5, 2001 10:34 am
... Sieve, ... used Indeed, it's still doing sterling service and is probably the method of choice for general integers in the range 50-110 digits. I have...
486
Chris Harrison
softwaretools@...
Mar 5, 2001 11:46 am
Dear All, Please be aware that I have e-mailed Phil Carmody TWICE to ask him to ... and he has not responded, hence this e-mail. There are IN FACT bulk...
487
Jack Brennen
jack@...
Mar 5, 2001 12:47 pm
... To quote from the definitive web resource on prime numbers: http://www.utm.edu/research/primes/notes/faq/LongestList.html "The problem with answering this...
488
Phil Carmody
fatphil@...
Mar 5, 2001 1:16 pm
... My mail receiving operation M could be nilpotent. Or maybe M is idempotent. Perhaps neither of the above. If so, and M^2 == I... ... You should see my...
489
Phil Carmody
fatphil@...
Mar 5, 2001 2:16 pm
... Yuppers. Amusingly, as I _thought_ QS, I typed _NFS_! I'd counciously forgotten about NFS. ... In the words of my Finnish teacher "you can't even pronounce...
490
Paul Leyland
pleyland@...
Mar 5, 2001 3:28 pm
... Implementing NFS from scratch is somewhat non-trivial. I'd estimate about a year's work to get something worthwhile. QS, on the other hand, is rather ...
491
Phil Carmody
fatphil@...
Mar 5, 2001 3:37 pm
This has turned into a quite fun day (sad sad man that I am - sue me!) http://www.math.niu.edu/~rusin/known-math/index/11Y05.html Seems to be a fairly good...
492
Jud McCranie
jud.mccranie@...
Mar 5, 2001 4:53 pm
At 11:45 AM 3/5/2001 +0000, Chris Harrison wrote: There are IN FACT bulk sequences of primes up to 19 digits in length ... I've got a list up to 2^32, which is...
493
Jud McCranie
jud.mccranie@...
Mar 5, 2001 4:53 pm
... I keep my list up to 2^32 on disk, even though I think it would be faster to generate them. (At some point it becomes slower to generate them.) The ...
494
Ben Bradley
benbradley@...
Mar 5, 2001 8:16 pm
... I've got something similar on my website - a short description of primes, with C source to programs to generate and read primes in a successive-differences...
495
Jud McCranie
jud.mccranie@...
Mar 5, 2001 9:41 pm
At 03:16 PM 3/5/2001 -0500, Ben Bradley wrote: I heard and read several places that it's faster to generate primes ... It is up to a point, and that point...
496
Phil Carmody
fatphil@...
Mar 5, 2001 9:46 pm
A carefully constructed dump of a sieve will beat most run-length compression schemes, even with huffman (or other entropy) compresion. For broad ranges, I'd...
497
Chris Caldwell
caldwell@...
Mar 6, 2001 4:49 pm
... Like Chris, I thought these were rather old, but I spent some time in the library and it turns out that perhaps they are not. The "originator" seems to be...
498
ajw01@...
Mar 6, 2001 11:16 pm
Has SNFS been used for any numbers other than those of the form b^n+-1 and their factors? Could it be? Andrew Walker...
499
prime_bo@...
Mar 7, 2001 1:00 am
Is there a accurate way of calculating Pi(N)? I have heard of X/(LN(X)), but it is not entirely accurate. Is there a more precise equation or method other than...
500
Jud McCranie
jud.mccranie@...
Mar 7, 2001 1:21 am
... There are several formulas that are more accurate, for instance ones by Riemann, Legendre, and Tchebecev (sp?) I think. x/(ln(x)-1) is more accurate, and...
501
d.broadhurst@...
Mar 7, 2001 1:36 am
... Oh, I bet long before some hunter-gather's grunted along these lines round a fire: Ugg: Caught summat? Glugg: Two no-names! Can't see that the curios thing...
502
S.Tomabechi
tomabeti@...
Mar 7, 2001 3:30 am
Do you mean Pi(N) = #{ prime numbers < N } ? If it is so, there is an accurate method so called Meissel-Lehmer method. I heard that calucation was done for N...
503
Jud McCranie
jud.mccranie@...
Mar 7, 2001 3:36 am
... That gives an exact count, but it takes a lot of computation. +--------------------------------------------------------+ ... ...
504
Phil Carmody
fatphil@...
Mar 7, 2001 7:27 am
... Mathematica's Implementation Notes: <<< Prime and PrimePi use sparse caching and sieving. For large , the LagariasMillerOdlyzko algorithm for PrimePi...
505
Paul Leyland
pleyland@...
Mar 7, 2001 10:30 am
... Yes to both. It can be used for anything which can be expressed as a "small" polynomial. Look at ...
506
Chris Caldwell
caldwell@...
Mar 7, 2001 2:04 pm
... No doubt. But my context is simpler, I was looking for references; and the first seems to be Epimenides. But I'd be glad to reference the hunter...
507
Phil Carmody
fatphil@...
Mar 9, 2001 9:58 am
Hi folks, I'm looking for a small logo or icon to represent "primeness". It's to catch people's eye on someone else's page, as they link to the PrimePages. ...
