Now let’s illustrate the process I just described but using the primorial-based place value numbering system.

Consider the set of non-primes and possible primes within P3# = 5# = 30:

The “possible primes” are: 1, 7, 11, 13, 17, 19, 23, and 29, or:

0,0,1

1,0,1

1,2,1

2,0,1

2,2,1

3,0,1

3,2,1

4,2,1

Recall the meaning of “possible primes” is that these positions within all successive repetitions of groups of 30 natural numbers *may* have prime numbers at those positions, but those positions do not *have to* be prime. All other positions with repetitions of 30 can NEVER be prime, since they are all multiples of 2, 3 or 5. The primes we have already used to sieve, 2, 3 and 5, do not appear in this list but are known by now to be prime.

To obtain the set of possible primes within the next primorial, P4#, 210, we will repeat this pattern 6 more times, or in other words add 30 to each of these numbers 6 times, to yield 7 sets of 30 within 210, giving us the following set of numbers, A7:

0,0,0,1; 1,0,0,1; 2,0,0,1; 3,0,0,1; 4,0,0,1; 5,0,0,1; 6,0,0,1

0,1,0,1; 1,1,0,1; 2,1,0,1; 3,1,0,1; 4,1,0,1; 5,1,0,1; 6,1,0,1

0,1,2,1; 1,1,2,1; 2,1,2,1; 3,1,2,1; 4,1,2,1; 5,1,2,1; 6,1,2,1

0,2,0,1; 1,2,0,1; 2,2,0,1; 3,2,0,1; 4,2,0,1; 5,2,0,1; 6,2,0,1

0,2,2,1; 1,2,2,1; 2,2,2,1; 3,2,2,1; 4,2,2,1; 5,2,2,1; 6,2,2,1

0,3,0,1; 1,3,0,1; 2,3,0,1; 3,3,0,1; 4,3,0,1; 5,3,0,1; 6,3,0,1

0,3,2,1; 1,3,2,1; 2,3,2,1; 3,3,2,1; 4,3,2,1; 5,3,2,1; 6,3,2,1

0,4,2,1; 1,4,2,1; 2,4,2,1; 3,4,2,1; 4,4,2,1; 5,4,2,1; 6,4,2,1

From this set we will now remove multiples of 7 as follows: Take the set of possible primes within 30, namely 1, 7, 11, 13, 17, 19, 23, and 29, and multiply each by 7, giving us 7, 49, 77, 91, 119, 133, 161, 203, or the following set, B7:

0,1,0,1

1,3,0,1

2,2,2,1

3,0,0,1

3,4,2,1

4,2,0,1

5,1,2,1

6,3,2,1

Now remove the set B7 from A7 to get the set of possible primes within 7#, which we call PP7:

0,0,0,1; 1,0,0,1; 2,0,0,1; ——-; 4,0,0,1; 5,0,0,1; 6,0,0,1

——-; 1,1,0,1; 2,1,0,1; 3,1,0,1; 4,1,0,1; 5,1,0,1; 6,1,0,1

0,1,2,1; 1,1,2,1; 2,1,2,1; 3,1,2,1; 4,1,2,1; ——-; 6,1,2,1

0,2,0,1; 1,2,0,1; 2,2,0,1; 3,2,0,1; 4,2,0,1; 5,2,0,1; 6,2,0,1

0,2,2,1; 1,2,2,1; ——-; 3,2,2,1; 4,2,2,1; 5,2,2,1; 6,2,2,1

0,3,0,1; ——-; 2,3,0,1; 3,3,0,1; 4,3,0,1; 5,3,0,1; 6,3,0,1

0,3,2,1; 1,3,2,1; 2,3,2,1; 3,3,2,1; 4,3,2,1; 5,3,2,1; ——-

0,4,2,1; 1,4,2,1; 2,4,2,1; ——-; 4,4,2,1; 5,4,2,1; 6,4,2,1

Now wasn’t that easy? 🙂

Now if we want to know all primes less than 7^2 = 49, we can examine this list. All known primes 2, 3, 5 and 7 are prime, followed by the remaining “possible primes” less than 49, or 11, 13, 17, 19, 23, 29, 31, 37, 41, and 43, or:

0,1,2,1

0,2,0,1

0,2,2,1

0,3,0,1

0,3,2,1

0,4,2,1

1,0,0,1

1,1,0,1

1,1,2,1

1,2,0,1