OFFSET
1,1
COMMENTS
For p > 2 there is some prime dividing sigma(p^(p-1)) for which k^p - p is not divisible by the prime for any k. Thus a(n) exists and is at most sigma(p^(p-1)).
LINKS
Charles R Greathouse IV, Table of n, a(n) for n = 1..1000
PROG
(PARI) a(n)=my(p=prime(n)); forprime(q=2, default(primelimit), for(k=2, p, if(Mod(k, q)^p==p, next(2))); return(q)) \\ Charles R Greathouse IV, May 09 2012
CROSSREFS
KEYWORD
nonn
AUTHOR
Charles R Greathouse IV, May 09 2012
STATUS
approved