Test for not Prime.

IF N is any odd number
AND mod(N+1, 12) <> 0
AND mod(N+5,12) <> 0
AND mod(N+7,12) <> 0
AND mod(N+11,12) <> 0
THEN N is not Prime number.

To which sequence of odd numbers belongs any given odd number N > 11?
If N has 3 as its primary factor then N belongs to sequences started from 3 and 9.
If mod(N+11, 12) = 0 N belongs to sequence started from 1.
If mod(N+7, 12) = 0 N belongs to sequence started from 5.
If mod(N+5, 12) = 0 N belongs to sequence started from 7.
If mod(N+1, 12) = 0 N belongs to sequence started from 11.

if we use N as some kind of "seed" then N +12k or N - 12k (where k = 1,2,3,...) will give us number which can be Prime.

[quote="Mblacob"]According Tesla’s Math Spiral Diagram, all prime numbers (excluding 2 and 3) belong to 1/3 part of natural numbers set:
[tex]M1(n) = 1 + (n -1) * 12;[/tex]
[tex]M5(n) = 5 + (n -1) * 12;[/tex]
[tex]M7(n) = 7 + (n -1) * 12;[/tex]
[tex]M11(n) = 11 + (n -1) * 12;[/tex]

According Tesla’s Math Spiral Diagram these two sets of natural odd numbers:

M3(n)=3+(n−1)∗12;
M9(n)=9+(n−1)∗12;

don’t have any Prime numbers because ALL their numbers have 3 as the prime factor.

According Tesla’s Math Spiral Diagram, all prime numbers (excluding 2 and 3) belong to 1/3 part of natural numbers set:
[tex]M1(n) = 1 + (n -1) * 12;[/tex]
[tex]M5(n) = 5 + (n -1) * 12;[/tex]
[tex]M7(n) = 7 + (n -1) * 12;[/tex]
[tex]M11(n) = 11 + (n -1) * 12;[/tex]

Statement. Any not prime number in these sets has the prime number(s) as its divisor(s)/factor(s).

Can this statement be proofed or not?