OFFSET
1,4
COMMENTS
By Wilson's theorem, we know that for each prime p there is at least one m such that p divides m!+1. The largest such m is p-1. Sequence A073944 lists the smallest m for each prime.
LINKS
T. D. Noe, Table of n, a(n) for n = 1..2000
EXAMPLE
a(20)=7 because 71, the 20th prime, divides m!+1 for the seven values m=7,9,19,51,61,63,70. Interesting, note that 7+63=9+61=19+51=70.
MATHEMATICA
Table[p=Prime[i]; cnt=0; f=1; Do[f=Mod[f*m, p]; If[f+1==p, cnt++ ], {m, p-1}]; cnt, {i, 150}]
PROG
(PARI) a(n, p=prime(n))=my(t=Mod(1, p)); sum(k=1, p-1, t*=k; t==-1) \\ Charles R Greathouse IV, May 15 2015
CROSSREFS
KEYWORD
nonn
AUTHOR
T. D. Noe, Mar 01 2006
STATUS
approved