lucas-lehmer theorem

[Robot2357]

Hello,
there are various generalization of the lucas-lehmer test,for example one is in http://mathworld.wolfram.com/Lucas-LehmerTest.html for N+1.
I think that i've found another generalization to the theorem and proved the sufficent part.
but it seems that the necessary part is beyond my mathematical skill.so,suppose that the theorem that i'm speak about it is not know,my question is:
do i have to spent months(years?) to gain the right amount of math knowledge and try to complete the proof,and maybe let another person discover the same thing, or it's better to release an incomplete theorem and let the necessary part to someone else?

[John Renze]

Originally Posted by Robot2357

do i have to spent months(years?) to gain the right amount of math knowledge and try to complete the proof,and maybe let another person discover the same thing, or it's better to release an incomplete theorem and let the necessary part to someone else?

Mathematics is a collaborative endeavor. Post what you know here and people will discuss it.

John

[T.Rex]

Originally Posted by Robot2357

Hello,
there are various generalization of the lucas-lehmer test, ...
I think that i've found another generalization to the theorem and proved the sufficent part.

It is not widely known that the LLT can be used to prove the primality of other numbers than Mersenne numbers. Moreover, many people think that only numbers N for which a factorization of N+1 is known (like Mersenne numbers) can be proved prime by the LLT. As an example, the LLT can also be used for Fermat numbers, see my paper.
It is the same for the Pépin's test. It can be used for proving the primality of a kind of Generalized Fermat Numbers, see Saouter .
Let describe your findings here. Better Mathematicians than me will help you to understand if it is new or not.
Tony

[hoca]

S(n)=2*S(n-1)^2 -1 where S(0)=2

[ewmayer]

Originally Posted by hoca

S(n)=2*S(n-1)^2 -1 where S(0)=2

A.k.a. "LLT in slight disguise."

[R.D. Silverman]

Originally Posted by hoca

S(n)=2*S(n-1)^2 -1 where S(0)=2

Don't cross post. I already answered you in another thread.

[princeps]

Generalization of Lucas-Lehmer-Riesel Test