Hello, Last night I could get to sleep and I was counting primes ;) Because it was hard to test if a number is divisible I found it is easier to decrement a list of predecessors. But first things first: the description of my algorithm
start with e = 3, a = (), b= () 1\ decrement all elements of list a by 1 2\ test if an element of list a is zero if no elements are found e is prime 3\ reset all 0-elements of a to b 4\ add e to a and b The advantage of the algorithm is, it uses only trivial operation (decrement, test if zero, move operations) The drawback is, it uses a lot of RAM if the numbers to test getting high. What I want to know is: Is this algorithm known to the prime public? If so, where did I find additional information about it? (e.g. the complexity of this algrithm) greetings Christian
_______________________________________________ Prime mailing list [email protected] http://hogranch.com/mailman/listinfo/prime
