- #1

- 2

- 0

Curious about this pattern.

list(6N,-1,+1)less list((6n,-1,+1)*(6N,-1,+1)) produces 100% primes =>5 for as far as I am able to take it.

Sorry the dwgs would not copy so have added attachments.

This pattern of products repeats by value (first digit set, second digit set, etc) and by position so as I am humbled by not knowing enough to take it much farther on my own. just an average guy looking at some patterns and do not know just how to present them. I try but the brain ain't what it was.

A=6N,-1,+1 gives a list 1,5,7,11,13… for values of N=0:step 1 and for A being a whole real number. This list A contains Primes and Prime Products >=5. The first Prime Product in the list A is 25. (5*5) and so on as you build an array using (list A)*(list A) to give a complete list of Prime Products in list B. (within the array are duplicates as a*b=c and b*a=c and these duplicates are separated or isolated as values of n2 ) Then if you remove list B from list A you have 100% primes in sequence and without any exceptions that I have found. Exploring this farther I find that the individual product list for value A is 6NA,-A,+A. example would be A=5: N=0:step1 begins with value A step 1,+1,..gives 25,35,55,65,..

Please note that the products of 5 are underlined and form a grid that is consistent throughout the lists and arrays. As is true for all values A with horizontal and vertical columns being first and second products etc. Although not shown here the positional

Sequence is identical.

Question: Could these patterns of the list A, of the product list B and the positional of each be a basis for a derivable pattern to the Prime. All products sequence both in value and position and the positional placements are fixed and all repeat in finite sets as 2,102,1002…5,155,1505…1,31,301,3001. For the 1 digit set you need only look at the array above and note the value of the first digit repeats in sets of 10 out of 30 as (1,5,7,1,3,7,9,3,5,9) for the two digit set you must go to 100 out of 300, etc. As all appear to be finite repeating sets and if you only consider the positional array then it would seem that the positional array would also repeat and allow the removal of products not by value but by positions that repeat.

I simply do not know and would like an opinion please. I am just an average Bob that was curious and without any math or programming background needed to test this.

Thank you in advance

Bob.

list(6N,-1,+1)less list((6n,-1,+1)*(6N,-1,+1)) produces 100% primes =>5 for as far as I am able to take it.

Sorry the dwgs would not copy so have added attachments.

This pattern of products repeats by value (first digit set, second digit set, etc) and by position so as I am humbled by not knowing enough to take it much farther on my own. just an average guy looking at some patterns and do not know just how to present them. I try but the brain ain't what it was.

A=6N,-1,+1 gives a list 1,5,7,11,13… for values of N=0:step 1 and for A being a whole real number. This list A contains Primes and Prime Products >=5. The first Prime Product in the list A is 25. (5*5) and so on as you build an array using (list A)*(list A) to give a complete list of Prime Products in list B. (within the array are duplicates as a*b=c and b*a=c and these duplicates are separated or isolated as values of n2 ) Then if you remove list B from list A you have 100% primes in sequence and without any exceptions that I have found. Exploring this farther I find that the individual product list for value A is 6NA,-A,+A. example would be A=5: N=0:step1 begins with value A step 1,+1,..gives 25,35,55,65,..

Please note that the products of 5 are underlined and form a grid that is consistent throughout the lists and arrays. As is true for all values A with horizontal and vertical columns being first and second products etc. Although not shown here the positional

Sequence is identical.

Question: Could these patterns of the list A, of the product list B and the positional of each be a basis for a derivable pattern to the Prime. All products sequence both in value and position and the positional placements are fixed and all repeat in finite sets as 2,102,1002…5,155,1505…1,31,301,3001. For the 1 digit set you need only look at the array above and note the value of the first digit repeats in sets of 10 out of 30 as (1,5,7,1,3,7,9,3,5,9) for the two digit set you must go to 100 out of 300, etc. As all appear to be finite repeating sets and if you only consider the positional array then it would seem that the positional array would also repeat and allow the removal of products not by value but by positions that repeat.

I simply do not know and would like an opinion please. I am just an average Bob that was curious and without any math or programming background needed to test this.

Thank you in advance

Bob.

#### Attachments

Last edited: