Prime lists and Computation
- From: Carl Parkes <Carl_Parkes@xxxxxxxxxxx>
- Date: Sat, 09 Jul 2005 06:19:02 GMT
Q1. Given a large integer {x} . If it is proved to be prime, what other
information is generated?
1. Complete Prime list to x^(1/2)?
2. The modulo residues?
Q2 Is their a complete list of primes to X Published?
X~ 10^20? X~10^30. X= 10^??
,
Q3 Storage: When does it become more efficient to store the prime list than
to generate/calculate it.
Q4 What would be the expected time to factor a 1 MB file, if it was
interpreted as a very integer.
--
Carl Parkes
The world is flat it's pi that's round!
There is only one number.
Complete Prime list to x :: all primes<= x in order
.
- Follow-Ups:
- Re: Prime lists and Computation
- From: *** T. Winter
- Re: Prime lists and Computation
- From: Helmut Richter
- Re: Prime lists and Computation
- Prev by Date: Re: periodic points
- Next by Date: Re: People are stupid
- Previous by thread: Linear Algebra/ Group Theory
- Next by thread: Re: Prime lists and Computation
- Index(es):