let's look at primes over 100.tentatively, this is a generative, positive algorithm for all primes.99de8ab101e0101d9a06d4bb1de43c1695e074a3sure, as the series continues rules 1 and 3 are applied recursively +1)1 elur( 9 sop morf 8+6+4+1+87 1601 79 6225 89 964 78+1+4+6 from pos 9 (rule 1)24 83 875 78+1+4 from pos 9 (rule 1)23 79 792 78+1 From Pos 9 (rule 1)22 73 713 59+6+2+4+2 from pos 8 (rule 3)21 71 640 59+6+2+4 from pos 8 (rule 3)20 67 569 59+6+2 from pos 8 (rule 3)19 61 502 59+2 from pos 8 (rule 3)18 59 441 from pos 8 (rule 2))1 elur( 7 sop morf 6+4+1+24 283 35 7116 47 329 42+1+4 from pos 7 (rule 1)15 43 282 42+1 from pos 7 (rule 1)RL13 37 198 29+2+6 (rule 3)12 31 161 29+2 (rule 3)11 2 2 29 0 0 3 3 130 0 0 0 0 4 3 from 3 pos 5 6 5 (rule 4 2)10 23 101 18+4 from pos 5 (rule 1)9 19 78 18+1 from pos 5 (rule 1)RL7 13 42 11+2 (rule 3)6 11 29 from pos 4 (rule 2)5 7 18 6+1 from pos 3 (rule 1)4 5 11 3+2 (rule 3)3 3 6 from pos 2 (rule 2)2 0 0 0 2 0 0 0 0 0 3 0 0 0 0 0 0 0 0 1+1 1 from 0 pos 0 1 0 (rule 0 1)1 1 1 fucking offsetpos prime primesum comment7461626c650d0a+2,+4,+6,+2, etc.rule 3: primesums at pair positions generates primes in recursive cycles114 117 108 101 32 50 58 32 112 114 105 109 101 115 117 109 115 32 97 116 32 112 97 105 114 32 112 111 115 105 116 105 111 110 115 32 40 50 44 52 44 54 44 56 44 101 116 99 41 32 97 114 101 32 112 114 105 109 101 115 46 13 10 cycles +1,+4,+6,+8, etc.rule 1: primesums at odd positions (1,3,5,7,9,etc) generates primes inAlgorithm applied on the 100 first primesthere..notice 4 that 4 i 4 work 4 from 7 the 7 primesum 3 also 7 and 7 generate 4 primes 6 fromoh this is already a mess3, sum 6, and we get 5 from +2ARPRMS0MSLFS2, by +1 (from pair number positions), sum 3, and sums from pair num.pos1, sum 1fgnegvat bss sebz 1.
