|
|
A071522
|
|
Numbers n such that x^n + x^(n-1) + x^(n-2) + ... + x + 1 is irreducible over GF(5).
|
|
1
|
|
|
1, 2, 6, 16, 22, 36, 42, 46, 52, 72, 82, 96, 102, 106, 112, 136, 156, 166, 172, 192, 196, 222, 226, 232, 256, 262, 276, 282, 292, 306, 316, 346, 352, 372, 382, 396, 432, 442, 462, 466, 502, 522, 546, 556, 562, 576, 586, 592, 606, 612, 616, 646, 652, 672, 676
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
1,2
|
|
COMMENTS
|
Numbers k = p - 1 such that p is a prime with primitive root 5. - Joerg Arndt, Jun 25 2020
|
|
LINKS
|
|
|
FORMULA
|
|
|
MAPLE
|
filter:= proc(n)
isprime(n+1) and numtheory:-order(5, n+1)=n
end proc:
|
|
MATHEMATICA
|
Select[Prime[Range[1000]], MultiplicativeOrder[5, #] == # - 1&] - 1 (* Jean-François Alcover, Aug 16 2020 *)
|
|
PROG
|
(PARI) forprime(p=2, 10^3, if(p==5, next()); if(znorder(Mod(5, p))==p-1, print1(p-1, ", "))); \\ Joerg Arndt, Jun 25 2020
|
|
CROSSREFS
|
|
|
KEYWORD
|
easy,nonn
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|