|
%I #15 Sep 08 2022 08:44:58
%S 2,7,17,23,31,41,47,71,73,79,89,97,103,113,127,137,151,167,191,193,
%T 199,223,233,239,241,257,263,271,281,313,337,353,359,367,383,401,409,
%U 431,433,439,449,457,463,479,487,503,521,569,577,593,599,601,607,617,631
%N Primes p such that x^62 = 2 has a solution mod p.
%C Complement of A059646 relative to A000040. - _Vincenzo Librandi_, Sep 15 2012
%H R. J. Mathar, <a href="/A049594/b049594.txt">Table of n, a(n) for n = 1..1000</a>
%H R. J. Mathar, <a href="/A049594/a049594.txt">Maple programs for this and related sequences</a>
%H <a href="/index/Pri#smp">Index entries for related sequences</a>
%t ok[p_]:= Reduce[Mod[x^62 - 2, p] == 0, x, Integers] =!= False; Select[Prime[Range[150]], ok] (* _Vincenzo Librandi_, Sep 15 2012 *)
%o (Magma) [p: p in PrimesUpTo(700) | exists(t){x : x in ResidueClassRing(p) | x^62 eq 2}]; // _Vincenzo Librandi_, Sep 15 2012
%Y Cf. A000040, A059646.
%K nonn,easy
%O 1,1
%A _N. J. A. Sloane_
|
