Try to calculate

From: 小葉南洋杉 (john65537_at_yahoo.com.tw)
Date: 05/29/03 

Date: 28 May 2003 20:02:53 -0700

I tried to calculate the number of primes of 512 bit long. Hope
someone may verify the result.
According to Gauss's prime number theorem, the number of primes less
than n should be n/ln(n).
2^512/ln(2^512) - 2^511/ln(2^511) = ?
Using my PC's Calculator got 1.885305082130081660668523138413e+151,
Really big. Somthing you cannot store in any computer.

Relevant Pages

  • Re: How to Generator Prime Numbers in a short time ?
    ... Now I initialize a mucher larger table which contains 4202 primes, ... that once you have found a probable prime you verify it with log/2 MR ... with a base of 2, then verify it with random bases for another 2 times, ...
    (sci.crypt)
  • Re: Special primes
    ... Do you see a logic or a reason for that? ... Can you verify it automatically for greater primes? ... Prev by Date: ...
    (sci.math)
  • Re: Try to calculate
    ... >> someone may verify the result. ... >> According to Gauss's prime number theorem, the number of primes less ... Somthing you cannot store in any computer. ... I'm not good at math, so I'd like to ask why the number of primes of ...
    (sci.crypt)
  • Re: Direct calculation of Primes - Possible?
    ... Chris Mattern wrote: ... suggest you get the book from http://calculateprimes.com and verify for ... It's clear that the algorithm generates primes, ... I've a small algorithm, too, which "generates primes, but perhaps ...
    (comp.security.unix)
  • Re: Direct calculation of Primes - Possible?
    ... suggest you get the book from http://calculateprimes.com and verify for ... It's clear that the algorithm generates primes, ... I've a small algorithm, too, which "generates primes, but perhaps ... Christopher Mattern ...
    (comp.security.unix)