Sieve of Atkin: Difference between revisions

Revision as of 18:40, 28 May 2006

Revision as of 18:47, 28 May 2006

Line 8:

#* If the entry is for a number with remainder 11, 23, 47, or 59, flip it for each possible solution to 3''x''² - ''y''² = ''entry_number'' when ''x'' > ''y'' > 0.

#* If the entry has some other remainder, ignore it completely.

# Start with the lowest number in the sieve list.

# Starting with seven, find the smallest number in the sieve list still marked prime and add it to the results list. Square the number and mark all multiples of that square as nonprime. Then, repeat with the next number still marked prime.

# Add the next number still marked prime in the sieve list to the results list.

# Square that number and mark all multiples of that square as nonprime.

# Repeat steps five through seven.

== Explanation ==