Home | Contact Us | FAQ | Search & Site Map | Link to Us
Sign In | Join | Other 45 Sites in Network
HomeAnnouncementsWhite Papers
Discussion GroupsFirst AidDatabasesJavaBeansGUIJava 3DVirtual MachineCORBASecurityToolsGeneral
Java DirectoryOpen Source ProjectsSample Book ChaptersUser GroupsWeb Resources
Related Topics
Databases.NETMore Topics ...

Java Forum / Security / August 2005

Tip: Looking for answers? Try searching our database.

where to find all the 512 bits prime numbers?

Thread view: 
Autumn-Fox - 10 Aug 2005 20:08 GMT
My current project happens to need me to find all the 512 bits prime
numbers.Where could I get them?

Thanks very much.

Fox
Thomas Hawtin - 10 Aug 2005 21:54 GMT
> My current project happens to need me to find all the 512 bits prime
> numbers.Where could I get them?

Has someone also asked you for the stripy paint? I guess there's around
1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000
of them. Give or take. (Actually I can't remember the formulas for
estimating the number of primes.)

Tom Hawtin
Signature

Unemployed English Java programmer
http://jroller.com/page/tackline/

IchBin - 10 Aug 2005 22:44 GMT
>> My current project happens to need me to find all the 512 bits prime
>> numbers.Where could I get them?
[quoted text clipped - 5 lines]
>
> Tom Hawtin

Beats me look at http://mathworld.wolfram.com/

Signature

Thanks in Advance...
IchBin, Pocono Lake, Pa, USA  http://weconsultants.servebeer.com
__________________________________________________________________________

'If there is one, Knowledge is the "Fountain of Youth"'
-William E. Taylor,  Regular Guy (1952-)

Richard Wheeldon - 11 Aug 2005 23:52 GMT
>> My current project happens to need me to find all the 512 bits prime
>> numbers.Where could I get them?
[quoted text clipped - 3 lines]
> of them. Give or take. (Actually I can't remember the formulas for
> estimating the number of primes.)

Iirc, there's roughly n/log(n) between 0 and n. Which in this case means
around 2^512 / 512 of them. Given that 2^512 is

13407807929942597099574024998205846127479365820592393377723561443721764030073546976801874298166903427690031858186486050853753882811946569946433649006084096

you're somewhat over, but probably close enough :)

Richard
Thomas Hawtin - 11 Aug 2005 23:59 GMT
>>>My current project happens to need me to find all the 512 bits prime
>>>numbers.Where could I get them?
[quoted text clipped - 10 lines]
>
> you're somewhat over, but probably close enough :)

I seem to have added an extra twelves more zeros than I meant. Should
have under estimated by almost 40 times. Not bad for a guess. (Guessed
as 2^512 is around 10^(3*512/10) and take off a bit for a few composites.)

Tom Hawtin
Signature

Unemployed English Java programmer
http://jroller.com/page/tackline/



Free Magazines

Get these publications absolutely FREE for up to 12 months. There are no hidden fees and no obligation. Simply choose a title, complete the application form and submit it. Read more ...

Oracle MagazineNetwork ComputingComputer WorldBio-IT WorldeWeekInformation WeekInfosecurity
 
Sign In
Join
My Latest Posts
My Monitored Threads
My Blog
My Photo Gallery
My Profile
My Homepage

Start New Thread
Enable EMail Alerts
Rate this Thread



©2008 Advenet LLC   Privacy Policy - Terms of Use
This website includes both content owned or controlled by Advenet as well as content owned or controlled by third parties.