Searched google but was not sucessfull in finding the info...

How many 256 bit (around 64 digit long) prime numbers are there and any site which lists them all....

thanx in advance

Printable View

- 11-17-2004vasanthPrime Nos
Searched google but was not sucessfull in finding the info...

How many 256 bit (around 64 digit long) prime numbers are there and any site which lists them all....

thanx in advance - 11-17-2004Salem
http://mathworld.wolfram.com/PrimeNumberTheorem.html

Up to a number n, there are approximately n/log(n) primes

So just do the calc for 2^256 and 2^257 and you have an approximate answer

I think you'll find that the number of primes is pretty large - so large that a list of them would be infeasable at best - 11-17-2004XSquared
There are about 6.4747x10^74 primes between 2^256 and 2^257. Good luck getting a list. :p

- 11-17-2004Govtcheez
Here's a do it yourself kit (some assembly required)

0123456789 - 11-17-2004Zach L.
Primes? You want primes? Here ya go:

Quote:

(k+2){1 – [wz+h+j–q]2 – [(gk+2g+k+1)(h+j)+h–z]2 – [2n+p+q+z–e]2 – [16(k+1)3(k+2)(n+1)2+1–f2]2 – [e3(e+2)(a+1)2+1–o2]2 – [(a2–1)y2+1–x2]2 – [16r2y4(a2–1)+1–u2]2 – [((a+u2(u2–a))2 –1)(n+4dy)2 + 1 – (x+cu)2]2 – [n+l+v–y]2 – [(a2–1)l2+1–m2]2 – [ai+k+1–l–i]2 – [p+l(a–n–1)+b(2an+2a–n2–2n–2)–m]2 – [q+y(a–p–1)+s(2ap+2a–p2–2p–2)–x]2 – [z+pl(a–p)+t(2ap–p2–1)–pm]2}

- 11-17-2004vasanth
hmmm i dint expect so many to be there since I though longer the number of digits lesser the prime numbers... looks like 64 wasnt long enough.. thanx anyway