|
%I #10 Sep 08 2022 08:46:03
%S 5,7,13,17,23,29,31,37,41,47,53,61,71,73,79,89,97,101,103,109,113,127,
%T 137,149,151,157,167,173,181,191,193,197,199,223,229,233,239,241,257,
%U 263,269,271,277,293,311,313,317,337,349,353,359,367,373,383,389,397
%N Primes p such that x^32 = -2 has no solution mod p.
%C Complement of A051085 relative to A000040.
%H Vincenzo Librandi, <a href="/A216747/b216747.txt">Table of n, a(n) for n = 1..1000</a>
%t ok[p_]:=Reduce[Mod[x^32 + 2, p] == 0, x, Integers] == False;Select[Prime[Range[200]], ok]
%o (Magma) [ p: p in PrimesUpTo(400) | not exists{x : x in ResidueClassRing(p) | x^32 eq -2} ]; //
%Y Cf. A000040, A051085, A059349.
%K nonn,easy
%O 1,1
%A _Vincenzo Librandi_, Sep 16 2012
%E Definition corrected by _Georg Fischer_, Feb 28 2021
|
