Re: Prime factorization
From: James Waldby (j-waldby_at_pat7.com)
Date: 09/27/04
- Next message: Anonymous: "Maximizing a discrete function"
- Previous message: George Cox: "Re: About pii and integers"
- In reply to: Wilhelm: "Re: Prime factorization"
- Next in thread: Phil Carmody: "Re: Prime factorization"
- Messages sorted by: [ date ] [ thread ]
Date: Mon, 27 Sep 2004 14:25:21 -0500
Wilhelm wrote:
> > Phil Carmody wrote:
> willem@bermon-dot-net.no-spam.invalid (Wilhelm) writes:
...
> What does 4! give you that 6 doesn't?
> ...
> > The sieve will not find numbers <n but these can be found when
> > creating the sieve. Anyway computations above 9! are memory hogs so
> >
> What does 9! give you that 210 doesn't?
...
> And for your information 9! = 362880 and i made a boo-boo because 10!
> is doable which is approx 3628800*whateveryouusetostoreyournumbers
> of sieving data.
...
Phil's comments were polite and entirely to the point, which
you missed. Factor 210 and 3628800, and you will see factor
lists of {2 3 5 7} and {2 2 2 2 2 2 2 2 3 3 3 3 5 5 7}.
Your pattern of length 3628800 consists of 1728 exact copies
of the length-210 pattern. If you want to use a few megabytes
to store a pattern, consider 510510 = 2*3*5*7*11*13*17. But
note that marginal improvement in efficiency drops rapidly as the
number of primes increases.
- Next message: Anonymous: "Maximizing a discrete function"
- Previous message: George Cox: "Re: About pii and integers"
- In reply to: Wilhelm: "Re: Prime factorization"
- Next in thread: Phil Carmody: "Re: Prime factorization"
- Messages sorted by: [ date ] [ thread ]
Relevant Pages
|
