|
%I #16 Sep 08 2022 08:44:58
%S 2,7,23,31,47,71,73,79,89,103,127,151,167,191,199,223,233,239,263,271,
%T 311,337,359,367,383,431,439,463,479,487,503,599,601,607,631,647,719,
%U 727,743,751,823,839,863,881,887,911,919,937,967,983,991,1031,1039
%N Primes p such that x^32 = 2 has a solution mod p.
%C Complement of A059349 relative to A000040. - _Vincenzo Librandi_, Sep 14 2012
%H R. J. Mathar, <a href="/A049564/b049564.txt">Table of n, a(n) for n = 1..1000</a>
%H <a href="/index/Pri#smp">Index entries for related sequences</a>
%t ok[p_]:= Reduce[Mod[x^32 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[300]], ok] (* _Vincenzo Librandi_, Sep 14 2012 *)
%o (Magma) [p: p in PrimesUpTo(1100) | exists(t){x : x in ResidueClassRing(p) | x^32 eq 2}]; // _Vincenzo Librandi_, Sep 14 2012
%Y Cf. A000040, A059349.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_
|
