A070670 - OEIS

A070670

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

1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 3, 1, 1, 6, 1, 1, 1, 1, 1, 2, 1, 4, 1, 1, 1, 1, 1, 1, 1, 10, 1, 1, 5, 1, 1, 1, 1, 1, 11, 1, 1, 1, 1, 16, 1, 1, 1, 1, 1, 9, 33, 1, 1, 1, 25, 1, 1, 1, 1, 5, 1, 1, 1, 16, 1, 15, 1, 1, 1, 1, 37, 1, 1, 1, 1, 1, 9, 1, 1

(list; graph; refs; listen; history; text; internal format)

OFFSET

1,11

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 &^ 5 mod n = 1 then return m fi

od; 1

end:

seq(a(n), n=1..100); # Alois P. Heinz, Jun 29 2014