|
%I #14 Sep 08 2022 08:44:53
%S 2,3,5,11,17,19,23,29,37,41,43,47,53,59,61,71,83,89,101,107,113,131,
%T 137,149,167,173,179,191,193,197,199,211,227,229,233,239,251,257,263,
%U 269,281,293,311,317,337,347,349
%N Primes p such that x^3 = 11 has a solution mod p.
%C Complement of A040061 relative to A000040. - _Vincenzo Librandi_, Sep 13 2012
%H Vincenzo Librandi, <a href="/A040060/b040060.txt">Table of n, a(n) for n = 1..1000</a>
%t ok [p_]:=Reduce[Mod[x^3 - 11, p] == 0, x, Integers] =!= False; Select[Prime[Range[180]], ok] (* _Vincenzo Librandi_, Sep 11 2012 *)
%o (Magma) [p: p in PrimesUpTo(450) | exists(t){x : x in ResidueClassRing(p) | x^3 eq 11}]; // _Vincenzo Librandi_, Sep 11 2012
%o (PARI) select(n->ispower(Mod(11, n),3), primes(500)) \\ _Charles R Greathouse IV_, Sep 11 2012
%Y Cf. A000040, A040061.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_.
|
