Beefy Boxes and Bandwidth Generously Provided by pair Networks
We don't bite newbies here... much
 
PerlMonks  

Re: Re: Finding Primes

by hagen (Friar)
on Aug 15, 2003 at 03:22 UTC ( #284084=note: print w/ replies, xml ) Need Help??


in reply to Re: Finding Primes
in thread Finding Primes

ROTFLH!!! Oh dear! BrowserUK ++ except I've used all mine up for today. I could have spent them all in this thread!

I'm no scientist (but I suspect a significant number of Monks in this thread really are). However, as I understand it, the following is true for some arbitrary approximation of truth

10**79 <= fpitu <= 10**81

`fpitu' = fundamental particles in the universe

So a 200 digit number is rather more than (111 orders of magnitude than?) is needed to allocate to each of these particles a unique number.

The estimation of the secondary storage space (!) requirement for this ultimate registry is also left to the numerically challenged.

hagen


Comment on Re: Re: Finding Primes

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://284084]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (17)
As of 2015-07-31 21:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (282 votes), past polls