Prev: an important set theory post-
Next: GetSolution Team
From: dan73 on 24 Jul 2008 16:29
Through a unique summation sieving algorithm it is
possible to sequentially produce all odd primes
up too any stopping point of (n) without using
any previous primes.
Likewise it is also possible to start with a large
prime and continue with this sequential list of
large primes up too any stopping point for (n)
without using any previous primes in the process
of generating these primes.


Here it is in Python code for all odd primes
up too (n)= 20000.
I am not sure if it will indent properly in
this post because in preview it shows no indents?

n= -2;n1= -4;n2= -1;n4=4;n5=1;b1=0;j=0
a=[0]*20001
data=[9,3,2,1,3,2]
for i in range(len(data)):
a1=data[i]
a1=a1+b1;a[a1]=a1;b1=a1
a1=b1+n;a[a1]=a1;b1=a1
n=n+n1
for x in range(20000):
i=n4
while i>=2:
a1=a1+i
if a1<=20000: a[a1]=a1
i=i-1
a1=a1+n
if a1<=20000: a[a1]=a1
n4=n4+n5;n=n-n4
for ii in range(10000):
i=2*ii+1
if a[i]==0 and i>1: print i,;j=j+1
print 'Total odd primes =',j
---------------------------------------------------
Prime print output = 3,5,7,11,..19997 which is the last
prime <n where n=20000 and gives a total number of odd primes = 2261.

So odd primes do have a pattern, complex as their pattern
may be through summations and negations starting with (9).
where this summation and negation never produce an odd prime.

It is very slow but shows this complex pattern of the odd primes
after the first summation of these 6 integers where no odd primes
are produced at each point of the summation.

+9+3+2+1+3+2

Then continuing with the summations and negations below
where also no odd primes are produced when this pattern
emerges.

-2
+4+3+2
-6
+5+4+3+2
-11
+6+5+4+3+2
-17
+7+6+5+4+3+2
-24
+8+7+6+5+4+3+2
-32
+9+8+7+6+5+4+3+2
-41
+10+..
etc.
The pattern for the negations is just the difference
of +4 and -2 = 6 ,so the next negation is just -6
The next negation is the difference of -6 and +5 = 11,
so the next negation is -11. and so on.
The other groups of summations have an obvious pattern
which increments by one from the previous group.

All the odd integers produced from these
summations and negations are composite and all the
odd integers (not) produced are primes except (1).

The problem is, many composites repeat one or more
times which adds to the processing time.

Dan
From: amy666 on 25 Jul 2008 03:15
> Through a unique summation sieving algorithm it is
> possible to sequentially produce all odd primes
> up too any stopping point of (n) without using
> any previous primes.
> Likewise it is also possible to start with a large
> prime and continue with this sequential list of
> large primes up too any stopping point for (n)
> without using any previous primes in the process
> of generating these primes.
>
>
> Here it is in Python code for all odd primes
> up too (n)= 20000.
> I am not sure if it will indent properly in
> this post because in preview it shows no indents?
>
> n= -2;n1= -4;n2= -1;n4=4;n5=1;b1=0;j=0
> a=[0]*20001
> data=[9,3,2,1,3,2]
> for i in range(len(data)):
> a1=data[i]
> a1=a1+b1;a[a1]=a1;b1=a1
> a1=b1+n;a[a1]=a1;b1=a1
> n=n+n1
> for x in range(20000):
> i=n4
> while i>=2:
> a1=a1+i
> if a1<=20000: a[a1]=a1
> i=i-1
> a1=a1+n
> if a1<=20000: a[a1]=a1
> n4=n4+n5;n=n-n4
> for ii in range(10000):
> i=2*ii+1
> if a[i]==0 and i>1: print i,;j=j+1
> print 'Total odd primes =',j
> ---------------------------------------------------
> Prime print output = 3,5,7,11,..19997 which is the
> last
> prime <n where n=20000 and gives a total number of
> odd primes = 2261.
>
> So odd primes do have a pattern, complex as their
> pattern
> may be through summations and negations starting with
> (9).
> where this summation and negation never produce an
> odd prime.
>
> It is very slow but shows this complex pattern of the
> odd primes
> after the first summation of these 6 integers where
> no odd primes
> are produced at each point of the summation.
>
> +9+3+2+1+3+2
>
> Then continuing with the summations and negations
> below
> where also no odd primes are produced when this
> pattern
> emerges.
>
> -2
> +4+3+2
> -6
> +5+4+3+2
> -11
> +6+5+4+3+2
> -17
> +7+6+5+4+3+2
> -24
> +8+7+6+5+4+3+2
> -32
> +9+8+7+6+5+4+3+2
> -41
> +10+..
> etc.
> The pattern for the negations is just the difference
>
> of +4 and -2 = 6 ,so the next negation is just -6
> The next negation is the difference of -6 and +5 =
> 11,
> so the next negation is -11. and so on.
> The other groups of summations have an obvious
> pattern
> which increments by one from the previous group.
>
> All the odd integers produced from these
> summations and negations are composite and all the
> odd integers (not) produced are primes except (1).
>
> The problem is, many composites repeat one or more
> times which adds to the processing time.
>
> Dan

???
From: dan73 on 25 Jul 2008 05:29
>> Through a unique summation sieving algorithm it is
>> possible to sequentially produce all odd primes
>> up too any stopping point of (n) without using
>> any previous primes.
>> Likewise it is also possible to start with a large
>> prime and continue with this sequential list of
>> large primes up too any stopping point for (n)
>>without using any previous primes in the process
>> of generating these primes.
>
>
>> Here it is in Python code for all odd primes
>> up too (n)= 20000.
>> I am not sure if it will indent properly in
>> this post because in preview it shows no indents?
>
> n= -2;n1= -4;n2= -1;n4=4;n5=1;b1=0;j=0
> a=[0]*20001
> data=[9,3,2,1,3,2]
> for i in range(len(data)):
> a1=data[i]
> a1=a1+b1;a[a1]=a1;b1=a1
> a1=b1+n;a[a1]=a1;b1=a1
> n=n+n1
> for x in range(20000):
> i=n4
> while i>=2:
> a1=a1+i
> if a1<=20000: a[a1]=a1
> i=i-1
> a1=a1+n
> if a1<=20000: a[a1]=a1
> n4=n4+n5;n=n-n4
> for ii in range(10000):
> i=2*ii+1
> if a[i]==0 and i>1: print i,;j=j+1
> print 'Total odd primes =',j
> ---------------------------------------------------
>> Prime print output = 3,5,7,11,..19997 which is the
>> last
>> prime <n where n=20000 and gives a total number of
>> odd primes = 2261.
>
>>So odd primes do have a pattern, complex as their
>> pattern
>> may be through summations and negations starting with
>> (9).
>> where this summation and negation never produce an
>> odd prime.
>>
>> It is very slow but shows this complex pattern of the
>> odd primes
>> after the first summation of these 6 integers where
>> no odd primes
>> are produced at each point of the summation.
>>
>> +9+3+2+1+3+2
>>
>> Then continuing with the summations and negations
>> below
>> where also no odd primes are produced when this
>> pattern
>> emerges.
>>
>> -2
>> +4+3+2
>> -6
>> +5+4+3+2
>> -11
>> +6+5+4+3+2
>> -17
>> +7+6+5+4+3+2
>> -24
>> +8+7+6+5+4+3+2
>> -32
>> +9+8+7+6+5+4+3+2
>> -41
>> +10+..
>> etc.
>> The pattern for the negations is just the difference
>
>> of +4 and -2 = 6 ,so the next negation is just -6
>> The next negation is the difference of -6 and +5 =
>> 11,
>> so the next negation is -11. and so on.
>> The other groups of summations have an obvious
>> pattern
>> which increments by one from the previous group.
>
>> All the odd integers produced from these
>> summations and negations are composite and all the
>> odd integers (not) produced are primes except (1).
>
>> The problem is, many composites repeat one or more
>> times which adds to the processing time.
>
>> Dan
____________________________________________________
amy666 wrote:

>(???)

And what are the three (???) questions?
 | 
Pages: 1
Prev: an important set theory post-
Next: GetSolution Team