Re: Some Prime number questions

From: Bill Rowe (bjrowe_at_earthlink.net)
Date: 05/21/03


Date: Tue, 20 May 2003 22:28:05 GMT

In article <3eca919b$0$45184$65c69314@mercury.nildram.net>,
 "m_houllier" <m_houllier@blew'ynder.co.uk> wrote:

> I suppose Prime's of a certain size is not as as large as all primes
> as it were. no simple task, but maybe someone at the NSA could help
> me :D

Actually, Tom gave you all the information you needed to estimate the
number of primes between 2^512 and 2^511

To be very clear the number of primes less than x approaches x/ln(x) as
x tends to infinity

So, the number of primes between 2^511 and 2^512 would be

2^512/ln(2^512) - 2^511/ln(2^511) ~ 1.9E151 ~ 2^503 or ~half the number
Tom previously posted which should be no surprise.



Relevant Pages

  • Re: fooling primality tests
    ... Tom St Denis wrote: ... are needed "only" the primes from 2 to ... [goto the zetagrid ...
    (sci.crypt)
  • Re: Enigma 1633 - Same perfect square
    ... Harry, Tom and I were each looking to find ... difference was also the product of two primes, ... was the same perfect square. ...
    (rec.puzzles)
  • Re: [Newbie] Prime factorization question
    ... tomstdenis@yahoo.com writes: ... the primes are randomly selected from those with a certain length. ... What was being talked about was RSA, ... not Diffie Hellman. ...
    (sci.crypt)
  • Re: Some Prime number questions
    ... I suppose Prime's of a certain size is not as as large as all primes as it ... but maybe someone at the NSA could help me:D ... > of primes for the sole reason there are far too many of them. ...
    (sci.crypt)
  • Re: DR Reductions
    ... Tom St Denis wrote: ... For primes of certain types of special forms, ...
    (sci.crypt)