Re: Prime lists and Computation
- From: Helmut Richter <a282244@xxxxxxxxxxxxxxxxxxxx>
- Date: 9 Jul 2005 15:19:48 GMT
Carl Parkes:
> 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)?
No.
> Q2 Is their a complete list of primes to X Published?
> X~ 10^20? X~10^30. X= 10^??
I have seen one up to 10^7 several years ago, published at the end of the
19th century. Since then, such lists have become uninteresting, at least
after the advent of computers. You can easily check a number less than
10^7 for primeness in a few minutes with a hand-held, non-programmable
pocket calculator which is less heavy than the book - and you save the way
to the library.
> Q3 Storage: When does it become more efficient to store the prime list than
> to generate/calculate it.
Never. Up to 10^k, there are about 3/7k * 10^k primes--too many for a list.
> Q4 What would be the expected time to factor a 1 MB file, if it was
> interpreted as a very integer.
Quite some time--you won't see the end of the computation.
Helmut Richter
.
- References:
- Prime lists and Computation
- From: Carl Parkes
- Prime lists and Computation
- Prev by Date: A giant meteor is about to strike the earth
- Next by Date: Re: Relative Cardinality
- Previous by thread: Prime lists and Computation
- Next by thread: Re: Prime lists and Computation
- Index(es):
Relevant Pages
|