|
|
A123271
|
|
Sign of the penultimate term of the Lucas-Lehmer sequence modulo the n-th Mersenne prime.
|
|
2
|
|
|
1, 1, -1, 1, -1, -1, 1, 1, -1, -1, 1, -1, -1, -1, 1, -1, -1, 1, -1, -1, 1, -1, 1, -1, 1, -1, 1, 1, 1, -1, 1, -1, -1, 1, 1, 1, 1, 1, 1, -1, 1, -1, -1, 1, -1, 1
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
2,1
|
|
COMMENTS
|
For the n-th Mersenne prime 2^p - 1 = A000668(n) (with p=A000043(n)), we have A003010(p-2) == 0 (mod 2^p - 1). Therefore A003010(p-3) == a(n) * 2^((p+1)/2) (mod 2^p - 1) where a(n) = 1 or -1.
From currently known Mersenne primes with exponents 57885161, 74207281, 77232917, 82589933 we have the sequence values (-1, -1, 1, -1), but there is a possibility of new Mersenne primes to be found out of order. - Serge Batalov, Feb 04 2013; updated by Max Alekseyev, Feb 25 2018, updated by Gord Palameta, Dec 21 2018
|
|
LINKS
|
|
|
FORMULA
|
|
|
EXAMPLE
|
For n=3, p=5, M_p=31, and the Lucas-Lehmer sequence is (4, 14, 8, 0). The penultimate element is 1*2^3 mod M_p = 8 mod 31, so a(3)=1.
For n=4, p=7, M_p=127, and the Lucas-Lehmer sequence is (4, 14, 67, 42, 111, 0). The penultimate element is -1*2^4 mod M_p = 111 mod 127, so a(4)=-1.
(End)
|
|
PROG
|
(PARI) test(p)=s=Mod(4, 2^p-1); for(i=1, p-3, s=s^2-2); r=2^((p+1)/2); if(s==+r, +1, s==-r, -1, "error") \\ Then a(n) = test(A000043(n)). From Jeppe Stig Nielsen, Jan 25 2016
|
|
CROSSREFS
|
|
|
KEYWORD
|
more,sign
|
|
AUTHOR
|
|
|
EXTENSIONS
|
a(47) confirmed and prospective a(49)-a(51) from Gord Palameta, Dec 21 2018
|
|
STATUS
|
approved
|
|
|
|