OFFSET
1,1
COMMENTS
Also integers n > 1 for which there is no prime p > n such that x = n is a solution mod p of x^5 = 2, since the following equivalences hold for n > 1: There is a prime p > n such that n is a solution mod p of x^5 = 2 iff n^5 - 2 has a prime factor > n; n is a solution mod p of x^5 = 2 iff p is a prime factor of n^5 - 2 and p > n.
EXAMPLE
12038 is a term since 12038^5 - 2 = 252796871460867395166 = 2*3*3*3*263*571*641*911*5849*9127 has no prime factor > 12038.
MATHEMATICA
t = {}; Do[If[Max[First/@FactorInteger[n^5-2]]<n, AppendTo[t, n]], {n, 2, 5*10^4}]; t (* Jayanta Basu, May 20 2013 *)
Select[Range[2, 133000], Max[FactorInteger[#^5-2][[;; , 1]]]<=#&] (* Harvey P. Dale, Mar 02 2023 *)
PROG
(PARI) {for(n=2, 133000, f=factor(n^5-2); if(f[matsize(f)[1], 1]<=n, print1(n, ", ")))}
CROSSREFS
KEYWORD
nonn
AUTHOR
Klaus Brockhaus, May 09 2003
STATUS
approved