Power???

[JohnFullspeed]

I need to find the first multiple of a prime number > an offset

i/e
Let Offset be 223092870
Let P be 21247
I want N like
Offfset+N = 223 093 500 = 105000 * 12247
223092870 div 21247 = 10499
223093500 -223092870 = 630 = N
I code this but I have a problem when the offset change
I do
N:=P-(offset mod p) Is the problem in the pollynome ?

Thanks

[science_man_88]

Originally Posted by JohnFullspeed

I need to find the first multiple of a prime number > an offset

i/e
Let Offset be 223092870
Let P be 21247
I want N like
Offfset+N = 223 093 500 = 105000 * 12247
223092870 div 21247 = 10499

223093500 -223092870 = 630 = N

I code this but I have a problem when the offset change
I do
N:=P-(offset mod p) Is the problem in the pollynome ?

Thanks

1)the bold is a massive arithmetic error ( yes I've checked it, and I'm guessing it's a typo?)
2)the underline is a line I personally don't see the use for
3)the italic is a spelling error
4) really because the line I wrapped in code tags says (Offset+N)-Offset = N

5) I come to: X=Offset+(P-(Offset%P)) working no ?

[JohnFullspeed]

( yes I've checked it, and I'm guessing it's a typo?)

Yes I inverse the two first digir of P

21247 is not 12247!!!!
223092870 div 21247 = 10499
P^10499 < Offset
p^10500 > Offset
N= P^10500- Offset
or
N=P-(offset mod p)
N must be >0 and < Offset)
I restart from 0 and I code verifying the error line by line

Have you an idea how to process the Golback conjecture:
all even value is the sum of two primes numbers??

John

[science_man_88]

Originally Posted by JohnFullspeed

( yes I've checked it, and I'm guessing it's a typo?)

Yes I inverse the two first digir of P

21247 is not 12247!!!!
223092870 div 21247 = 10499
P^10499 < Offset
p^10500 > Offset
N= P^10500- Offset
or
N=P-(offset mod p)
N must be >0 and < Offset)
I restart from 0 and I code verifying the error line by line

Have you an idea how to process the Golback conjecture:
all even value is the sum of two primes numbers??

John

a code I just made:

f=[];for(i=1,100,for(j=1,100,f=concat(f,if((prime(i)+prime(j))%2==0,prime(i)+prime(j)))));vecsort(f,,8)

[JohnFullspeed]

The polynome was goof the error was at the line just after.

I make N= N^2 ((an optimization) but it's good only if you begin at one:

1. Create a list of consecutive integers from 2 to n: (2, 3, 4, ..., n).
2. Initially, let p equal 2, the first prime number.
3. Starting from p, count up in increments of p and mark each of these numbers greater than p itself in the list. These numbers will be 2p, 3p, 4p, etc.; note that some of them may have already been marked.
4. Find the first number greater than p in the list that is not marked; let p now equal this number (which is the next prime).
5. If p is less than n, repeat from step 3. Otherwise, stop.

You can modify

3- Starting from p^2, count up in increments of p and mark each of these numbers greater than p itself in the list. These numbers will be 2p, 3p, 4p, etc.; note that some of them may have already been marked.

not if you make a continue search not a set of continues integers
John

[science_man_88]

Originally Posted by JohnFullspeed

The polynome was goof the error was at the line just after.

I make N= N^2 ((an optimization) but it's good only if you begin at one:




You can modify

3- Starting from p^2, count up in increments of p and mark each of these numbers greater than p itself in the list. These numbers will be 2p, 3p, 4p, etc.; note that some of them may have already been marked.

not if you make a continue search not a set of continues integers
John

not this again you made another thread!

if you are looking to make a code I'll give you the steps but you likely don't want that.