A070672 Smallest m in range 2..n-1 such that m^7 == 1 mod n, or 1 if no such number exists.

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, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1, 1, 1, 1, 8, 1, 1, 1, 1, 1, 1, 1, 1, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 11, 7, 1, 1, 1, 1, 1

Offset

1,29

Links

Alois P. Heinz, Table of n, a(n) for n = 1..10000

Maple

a:= proc(n) local m;
      for m from 2 to n-1 do
        if m &^ 7 mod n = 1 then return m fi
      od; 1
    end:
seq(a(n), n=1..100);  # Alois P. Heinz, Jun 29 2014

Prog

(PARI) a(n) = {for (m=2, n-1, if (lift(Mod(m, n)^7) == 1, return (m)); ); return (1); } \\ Michel Marcus, Jun 29 2014

Crossrefs

Cf. A070667.

Sequence in context: A249776 A348970 A053878 * A319101 A354487 A336699

Adjacent sequences: A070669 A070670 A070671 * A070673 A070674 A070675

Keyword

nonn

Author

N. J. A. Sloane, May 08 2002

Status

approved