|
%I #7 Sep 08 2022 08:46:03
%S 5,7,11,13,17,19,23,29,31,37,41,47,53,61,67,71,73,79,97,101,103,109,
%T 127,131,137,139,149,151,157,163,167,173,181,191,193,197,199,211,223,
%U 229,239,241,263,269,271,277,281,293,311,313,317,331,337,349,359,367
%N Primes p such that x^60 = -2 has no solution mod p.
%C Complement of A051099 relative to A000040.
%H Vincenzo Librandi, <a href="/A216775/b216775.txt">Table of n, a(n) for n = 1..1000</a>
%t ok[p_] := Reduce[Mod[x^60 + 2, p] == 0, x, Integers] == False;Select[Prime[Range[200]], ok]
%o (Magma) [p: p in PrimesUpTo(500) | not exists{x: x in ResidueClassRing(p) | x^60 eq -2}];
%Y Cf. A000040, A051099.
%K nonn,easy
%O 1,1
%A _Vincenzo Librandi_, Sep 16 2012
|
