login
The OEIS is supported by the many generous donors to the OEIS Foundation.

 

Logo
Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A070673 Smallest m in range 2..n-1 such that m^8 == 1 mod n, or 1 if no such number exists. 1
1, 1, 2, 3, 2, 5, 6, 3, 8, 3, 10, 5, 5, 13, 2, 3, 2, 17, 18, 3, 8, 21, 22, 5, 7, 5, 26, 13, 12, 7, 30, 3, 10, 9, 6, 17, 6, 37, 5, 3, 3, 13, 42, 21, 8, 45, 46, 5, 48, 7, 2, 5, 23, 53, 12, 13, 20, 17, 58, 7, 11, 61, 8, 7, 8, 23, 66, 9, 22, 13, 70, 17, 10, 31, 7, 37 (list; graph; refs; listen; history; text; internal format)
OFFSET
1,3
LINKS
MAPLE
a:= proc(n) local m;
for m from 2 to n-1 do
if m &^ 8 mod n = 1 then return m fi
od; 1
end:
seq(a(n), n=1..100); # Alois P. Heinz, Jun 29 2014
MATHEMATICA
a[n_] := Module[{m}, For[m = 2, m <= n-1, m++,
If[PowerMod[m, 8, n] == 1, Return[m]]]; 1];
Table[a[n], {n, 1, 100}] (* Jean-François Alcover, Mar 06 2024 *)
PROG
(PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^8) == 1, return (m)); ); return (1); } \\ Michel Marcus, Jun 29 2014
CROSSREFS
Cf. A070667.
Sequence in context: A349668 A214571 A135873 * A070669 A218613 A164912
KEYWORD
nonn
AUTHOR
N. J. A. Sloane, May 08 2002
STATUS
approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recents
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified April 24 00:30 EDT 2024. Contains 371917 sequences. (Running on oeis4.)