Prev: limit of a sum
Next: Conjeture or theorem?2
From: Victor Reijkersz on 18 Jul 2010 10:39
On Jul 18, 4:24 pm, Jacko <jackokr...(a)gmail.com> wrote:
> I'd suggest the optimal insert point is after all primes less than the
> prime to be inserted, and after and prime greater than the prime to be
> inserted which has an inserted at time (p^2-p)?? making it more
> relevant to be placed first.
>
> This reduces to a primes found list (p), and a marked number list (m)
> with an associated prime pointer to (p) element.
>
> The Seive of ?

Yes my algorithm can surely be optimized very much..

But you might be missing the main point.

The main reason i share the algorithm is because it shows that the
"gaps" between the composite-numbers uniquely created by any prime are
exactly the same as the gaps between the primes themselves.

I thought that was pretty relevant. And it points at a relation i dont
quite grasp but which feels pretty important. I was not sure if this
fact was common knowledge, hence me posting it here.

best,
vic
First  |  Prev  | 
Pages: 1 2
Prev: limit of a sum
Next: Conjeture or theorem?2