OFFSET
1,1
MATHEMATICA
Do[ k = 1; While[ ToString[ Factor[ x^Prime[ n ] + x^k + 1, Modulus -> 2 ] ] != ToString[ x^Prime[ n ] + x^k + 1 ] && k < Prime[ n ], k++ ]; If[ k == Prime[ n ], Print[ Prime[ n ] ] ], {n, 1, 144} ]
PROG
(PARI) lista(nn) = {forprime(p=2, nn, ok = 1; for (k=1, p-1, if (polisirreducible(Mod(1, 2)*(x^p + x^k + 1)), ok = 0; break); ); if (ok, print1(p, ", ")); ); }
CROSSREFS
KEYWORD
nonn
AUTHOR
Robert G. Wilson v, Oct 30 2000
STATUS
approved