|
%I #16 Sep 08 2022 08:44:53
%S 2,3,5,7,13,17,19,23,29,37,41,43,47,53,59,67,73,79,83,89,97,103,107,
%T 109,113,127,137,139,149,157,163,167,173,179,193,197,199,223,227,229,
%U 233,239,257,263,269,277,283,293,307,313,317,337,347,349,353,359,367,373
%N Primes p such that x^5 = 3 has a solution mod p.
%H Vincenzo Librandi, <a href="/A040161/b040161.txt">Table of n, a(n) for n = 1..1000</a>
%t ok [p_]:=Reduce[Mod[x^5 - 3, p]== 0, x, Integers]=!= False; Select[Prime[Range[180]], ok] (* _Vincenzo Librandi_, Sep 12 2012 *)
%o (Magma) [ p: p in PrimesUpTo(400) | exists(t){x : x in ResidueClassRing(p) | x^5 eq 3} ]; // _Klaus Brockhaus_, Jun 03 2009
%Y Cf. A040162 (primes p such that x^5 = 3 has no solution mod p).
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_
%E More terms from _Klaus Brockhaus_, Jun 03 2009
|
