Loading ...
Sorry, an error occurred while loading the content.
Advanced Search
Author
Subject
Message
Special notice only

Advanced Search
  • A week or so ago I posted a request for a volunteer to host the top-level ECMNET server which has to be moved from Microsoft Research in Cambridge, where it has lived for almost six years. Several people volunteered and I thank them all. Phil Carmody was the first of the volunteers. He and his system are an ideal match to what is required for the ECMNET server. Accordingly, he and...
    Paul Leyland Jul 5, 2004
  • See Crandall & Pomerance, Chapter 8. Specifically pp393/4 Paul > -----Original Message----- > From: mad37wriggle [mailto:fitzhughrichard@^$1] > Sent: 02 July 2004 14:34 > To: primenumbers@^$2 > Subject: [PrimeNumbers] M&M > > > Slightly off topic but does anyone know of any use being made > of prime numbers in > the arts (specifically music)? > > Richard...
    Paul Leyland Jul 2, 2004
  • My apologies: I made a typo. > Mark had done a little sieving on the entire range 800K-1M, which is > 400,002 candidates in all. He sieved to 1.0e8 and reduced the set to > 15500 candidates. That should be 1.0e9. Paul
    Paul Leyland Jun 30, 2004
  • Fetching Sponsored Content...
  • 10 days ago, Mark Rodenkirch posted: > In a few weeks, the search for Cullens and Woodalls (base 2) will be > completed to 800,000. I'm going to make a push to complete base 2 > to 1,000,000. I estimate that it will take me 18 to 24 months. It > would be nice to finish it sooner. On a 3 GHz P4, one can complete > a range of 10,000 (both Cullen and Woodall) in that range in about...
    Paul Leyland Jun 30, 2004
  • Yes, RSA-768. My typo. I've 576 on the mind these days. My conclusion still holds, once that silly typo is fixed. Paul > -----Original Message----- > From: Milton Brown [mailto:miltbrown@^$1] > Sent: 29 June 2004 15:40 > To: Paul Leyland; richard_heylen; primenumbers@^$2 > Cc: miltbrown > Subject: RE: [PrimeNumbers] Re: Predicted partial > factorization of RSA-576 > > > Small...
    Paul Leyland Jun 29, 2004
  • > Presumably there's a typo and this person means > 5768802686 > instead of > 5768802668 > as > > 5768802668999999999... * 2132481819999999... = > 123018668148... > which is clearly smaller than the required RSA 576 challenge number of > 123018668453... It's possible that there was a typo, I don't know. I'm pretty sure that the digits given are much more wrong than that, though...
    Paul Leyland Jun 29, 2004
  • Someone who may wish to remain nameless, so I'm not revealing his/her name or email address, sent me this prediction recently. > I have computed that the first 10 digits of RSA 768 as > > 57688 02668 and > > 21324 81819 It will be interesting to see whether this prediction is borne out. We should find out within a year or two. In the mean time, the prediction will be saved here for...
    Paul Leyland Jun 29, 2004
  • > Is this OBSERVATION part of a know theorem or has this OBSERVATION > been published before? I would appreciate any references to support > my studies. > > I would enjoy sharing my proof notes on the OBSERVATION and related > matters with interested parties. Yes, it has been observed before. A rather long time before, in fact. It is a simple consequence of Rp being equal to (10^p...
    Paul Leyland Jun 29, 2004
  • > Is there anyone that has the complete set of factors for 2^83 > - 1and is > there anyone that can confirm that factors for 2^47777783 -1 include > 2*47777783 + 1 and 24*47777783 - 1. If so can you get back to me. The first I can answer instantly. The latter takes time. According to the cunningham tables, of which I keep copies on my web site, the factors of 2^83-1 are 167 and...
    Paul Leyland Jun 26, 2004
  • Earlier I wrote: > Sadly, this has to come to an end and I am now looking for a volunteer > to take over the task. It is not arduous, but certain entry > requirements have to be met before the transfer can be made. followed by a list of requirements. Unfortunately, I forgot one. The server has traditionally run on port tcp/8194. There is no necessity for it to do so, but a lot of...
    Paul Leyland Jun 24, 2004