|
|
A103497
|
|
Multiplicative suborder of 11 (mod n) = sord(11, n).
|
|
1
|
|
|
0, 0, 1, 1, 1, 1, 1, 3, 2, 3, 1, 0, 1, 6, 3, 2, 4, 8, 3, 3, 2, 6, 0, 11, 2, 5, 6, 9, 6, 14, 2, 15, 8, 0, 8, 3, 3, 3, 3, 12, 2, 20, 6, 7, 0, 6, 11, 23, 4, 21, 5, 16, 12, 13, 9, 0, 6, 6, 14, 29, 2, 2, 15, 6, 16, 12, 0, 33, 16, 11, 3, 35, 6, 36, 3, 10, 6, 0, 12, 39, 4, 27, 20, 41, 6, 16, 7, 28, 0, 11, 6
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
OFFSET
|
0,8
|
|
COMMENTS
|
a(n) is minimum e for which 11^e == +-1 (mod n), or zero if no such e exists.
|
|
REFERENCES
|
H. Cohen, Course in Computational Algebraic Number Theory, Springer, 1993, p. 25, Algorithm 1.4.3.
|
|
LINKS
|
|
|
MAPLE
|
f:= proc(n) local x;
if n mod 11 = 0 then return 0 fi;
x:= numtheory:-mlog(-1, 11, n);
if x <> FAIL then x else numtheory:-order(11, n) fi
end proc:
f(1):= 0:
|
|
MATHEMATICA
|
Suborder[k_, n_] := If[n > 1 && GCD[k, n] == 1, Min[MultiplicativeOrder[k, n, {-1, 1}]], 0];
a[n_] := Suborder[11, n];
|
|
CROSSREFS
|
|
|
KEYWORD
|
|
|
AUTHOR
|
|
|
STATUS
|
approved
|
|
|
|