complement of si
 

when s0 = 2, s1 = 2*s0*s0-1, s2= 2*s1*s1-1 and so on
everybody will recognize lucas-lehmer test

M5=31 and divides s3
M7=127 and divides s5

lots of people are looking if Mp is prime or not?

but what with the complement?

s3/M5 = 607

i'm pretty sure that

s3/M5, s5/M7, s11/M13, s15/M17, s17/M19, s29/M31 and s59/M61 are prime.
in the last case, this means a number with more than 1.000.000.000 numbers
(for those numbers i have proof)


(for the moment i'am looking for a prime number with just a little over 1.000.000.000 numbers with similar methodology, creating such a number will take several months or even more time. maybe i can find proof more easily than creating the number :-) ... in my rare spare time ...)

[QUOTE=PAT291;452148](for the moment i'am looking for a prime number with just a little over 1.000.000.000 numbers ...[/QUOTE]Unless I misunderstood something it looks like you already got it.[QUOTE=PAT291;452148]s3/M5, s5/M7, s11/M13, s15/M17, s17/M19, s29/M31 and s59/M61 are prime.
in the last case, this means a number with more than 1.000.000.000 numbers
(for those numbers i have proof)[/QUOTE][size=1]BTW: Those little things that make up a number are called digits.[/size]

[QUOTE=PAT291;452148]when s0 = 2, s1 = 2*s0*s0-1, s2= 2*s1*s1-1 and so on
everybody will recognize lucas-lehmer test

M5=31 and divides s3
M7=127 and divides s5

lots of people are looking if Mp is prime or not?

but what with the complement?

s3/M5 = 607

i'm pretty sure that

s3/M5, s5/M7, s11/M13, s15/M17, s17/M19, s29/M31 and s59/M61 are prime.
in the last case, this means a number with more than 1.000.000.000 numbers
(for those numbers i have proof)


(for the moment i'am looking for a prime number with just a little over 1.000.000.000 numbers with similar methodology, creating such a number will take several months or even more time. maybe i can find proof more easily than creating the number :-) ... in my rare spare time ...)[/QUOTE]

the one thing I can say is that you can find out a few modular classes they are in all mersennes above 7 are 8x+7 from and all values in the sequence after 7 are 8k+1 so we can prove a remainder on division by 8 for all the divisions at very least.

[QUOTE=PAT291;452148]when s0 = 2, s1 = 2*s0*s0-1, s2= 2*s1*s1-1 and so on
everybody will recognize lucas-lehmer test[/quote]

Interesting... I do NOT recognize it as LL test, and yet, it seems to work!

[QUOTE=PAT291;452148]s3/M5, s5/M7, s11/M13, s15/M17, s17/M19, s29/M31 and s59/M61 are prime.[/QUOTE]

This is true for s3 & s5. It is not true for s11, s15 & s17. They are all composites (1168, 18737 and 74961 digits respectively). These are things you could have easily checked.
It is highly unlikely that you will find any more primes in this sequence.

[QUOTE=axn;452244]Interesting... I do NOT recognize it as LL test, and yet, it seems to work!



This is true for s3 & s5. It is not true for s11, s15 & s17. They are all composites (1168, 18737 and 74961 digits respectively). These are things you could have easily checked.
It is highly unlikely that you will find any more primes in this sequence.[/QUOTE]

it's a reduced form. if you realize all of the normal LL test numbers are even, and you know you mersenne numbers won't divide into 2 then you have x^2-2 -> 4*y^2-2 now both parts so the factor fo 2 we can divide it out and get 2*y^2-1 with a start of 2. ( and for the even valued seeds we can do the same 10 creates a start of 5 etc.)

[QUOTE=axn;452244]Interesting... I do NOT recognize it as LL test, and yet, it seems to work!



This is true for s3 & s5. It is not true for s11, s15 & s17. [B]They[/B] are all composites (1168, 18737 and 74961 digits respectively). [B]These[/B] are things you could have easily checked.
It is highly unlikely that you will find any more primes in this sequence.[/QUOTE]
What do "they"/"these" refer to exactly?
S15 is composite?
Or
S15/M17 is composite?

Thanks in advance.
ETA
Coming from axn and including S3 (which is not claimed to be prime), logically it should refer to S15/M17.
I just wished members here would be a bit more descriptive for comprehension of folks like myself.

[QUOTE=a1call;452259]What do "they"/"these" refer to exactly? [/QUOTE]

I PRP tested s11/M13, s15/M17, and s17/M19, and all three turned out to be composite. I thought it was obvious (from the quoted portion that preceded) that all references were to s3/M5, s5/M7, etc., but I can see now how it cold be confusing. Sorry.

The "these" refer to basic things that people should be doing before making "bold statements".

[QUOTE=PAT291;452148]when s0 = 2, s1 = 2*s0*s0-1, s2= 2*s1*s1-1 and so on
everybody will recognize lucas-lehmer test
[/QUOTE]
Yep, it is the Lucas-Lehmer test with bit rotation-by-1: s[SUB]j[/SUB] = normal_S[SUB]j[/SUB] >> 1. Functionally identical to LL. Doing bit rotation mod Mp is nothing new (Prime95 does it all the time, as you all know).

The cofactor of s[SUB]p-2[/SUB]/M[SUB]p[/SUB] doesn't seem to have any reason to be prime. Sometimes it may be, most of the time it won't.

on the basis, I started with some sequence

f0 = 7
f1 = 7*2702-f0
...
fi=fi-1*2702-fi-2
...

the strange thing was that 7 + i*24 seemed to be prime when it was a divisor of fi
it worked for the first thousands and thousands and more i
and I still don't know where it goes wrong the first time

fi mod (7+i24) = 0 seems to hold in most cases (primes of the form 7 + i*24)
although I know sometimes you get 0 not on i-th place

and apparently there are cases when you get 0 and 7 + i*24 is not a prime ...

it was to good to be true :sad:

(like most of the times)

An alternative formulation for the Lucas-Lehmer test:
[$]s_i=\sqrt2s_{i-1}+s_{i-2}; s_0=2, s_1=\sqrt2[/$]

[$]M_p=2^p-1[/$] is prime iff [$]s_{2^{n-1}}\equiv0 (mod M_p)[/$]

This is an example of a lucas-lehmer sequence which is a generalization of lucas sequences.

The normal formula that we know doubles i.
[$]s_{2i}=s_i^2-2[/$]

See [URL]http://siauliaims.su.lt/pdfai/2009/Ericksen-09.pdf[/URL] for further reading.

[QUOTE=henryzz;452337]An alternative formulation for the Lucas-Lehmer test:
[$]s_i=\sqrt2s_{i-1}+s_{i-2}; s_0=2, s_1=\sqrt2[/$]

[$]M_p=2^p-1[/$] is prime iff [$]s_{2^{n-1}}\equiv0 (mod M_p)[/$]

This is an example of a lucas-lehmer sequence which is a generalization of lucas sequences.

The normal formula that we know doubles i.
[$]s_{2i}=s_i^2-2[/$]

See [URL]http://siauliaims.su.lt/pdfai/2009/Ericksen-09.pdf[/URL] for further reading.[/QUOTE]
It appears that the even iterations can be worked out using:
[$]s_i=4s_{i-2}-s_{i-4}; s_0=2, s_2=4[/$]

Looks like I am reinventing the wheel. [url]https://oeis.org/A003500[/url] is already connected to [url]https://oeis.org/A003010[/url] Not surprising really.
The standard way of referring to this Lucas sequence of the second kind is [$]V_n(4,1)[/$]
It should be possible to work out SNFS polynomials for this sequence. I am unsure whether this will just boil down to x^2-2 and x^4-4x^2+2 for n a power of 2.