1. Let current number be x.
2. Let x +1 be y.
Two variables needed. x and y.
For any range prime number sieving do the following models:
1. Check divisibility of x by 2.
2. Check divisibility of x by 3.
3. Check divisibility of y by 4.
The above are the only methods needed.
Further steps are worked out.
By the way, I have registered copyright on two pi expressions.
( I don't like copyright or patents. But then . . . )
2. Let x +1 be y.
Two variables needed. x and y.
For any range prime number sieving do the following models:
1. Check divisibility of x by 2.
2. Check divisibility of x by 3.
3. Check divisibility of y by 4.
The above are the only methods needed.
Further steps are worked out.
By the way, I have registered copyright on two pi expressions.
( I don't like copyright or patents. But then . . . )
7 comments:
This needs practical computer.
I score 35 percent.
I shall make use of Euler prime generating equation sorts.
I shall then score 78.5 percent.
This finishes.
I shall exactly use Euler prime generating equation.
I shall use -n values.
Let me give an example.
33 to 40 range. Find primes.
33. 3 multiple. Not prime.
34. 2 multiple. Not prime.
35. Try 36 for 4. Yes 4 × 3 ×3. Two 3 multiple. Not prime.
36. 2 multiple. Not prime.
37. Try 36 for 4. Not happening.
Here I try 1+n squared. 1 + 6 squared. Prime.
38. 2 multiple. Not prime.
39. 3 multiple. Not prime.
I used x - 1 for y.
I used 1 + n = n squared in some fashion. Something something.
Is 17 a prime? Yes indeed 1 + 16.
10 and 26 eliminated because of even.
Above 41 I shall use n + n squared + 41. I swear.
Thanks.
Post a Comment