Yes, in some this similar to a wheel sieve.

Does a wheel use advance pattern like this does? ( 5 uses 2 & 3, 7 uses 2 & 5, 11 uses 4 & 7, 13 uses 4 & 9, and so on )

I believe the real difference lies in that

The core of the algorithm is Advance X “records”, Set the correct value to non-prime ...

At the risk of being snarky, which I don’t intend to be, 6502.org is a website that is devoted to the MOS Technology 6502 family of processors and bus-compatible peripherals.

I am sorry about that. I only posted here because I found similar discussions here.

I do have an interest in the MOS ...

Maybe this will help illustrate my concept.

I have found that it appears that all the value of the set { (6n-1) U (6n+1) } (5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37, ... N)

The pattern I found works like this

Following the pattern using 5 does not mark the numbers in bold because they ...

Yes, I am the same person.

If someone takes the time to review the questions and answers, I am hoping they can see my frustration.

I asked for opinions about

This is an algorithm of a prime sieve, and I am looking for ways to test its accuracy & efficiency. I am open to any suggestions.

I kept ...

Ok, I will be happy to.

Here is a more detailed psuedo code with two examples.

member = member of the set { (6n-1) U (6n+1) }

m = Multiple of member times 2 // 5 and 7 is 2, 11 and 13 is 4

odd = starting odd number

column = starting column number

x = m

switch column

Loop

x = x + odd

if ...

I have found what I think is a simple, possibly efficient, algorithm for a Prime Number Sieve.

This sieve is a process of taking a value from the set { 6x-1 U 6X+1 }, (5, 7, 11, 13, 17, 19, 23, 25, 29, 31, 35, 37 ... N ). Using that value as a starting point to move through the same of numbers ...