login
This site is supported by donations to The OEIS Foundation.

 

Logo

Annual Appeal: Please make a donation to keep the OEIS running. In 2018 we replaced the server with a faster one, added 20000 new sequences, and reached 7000 citations (often saying "discovered thanks to the OEIS").
Other ways to donate

Hints
(Greetings from The On-Line Encyclopedia of Integer Sequences!)
A049543 Primes p such that x^11 = 2 has a solution mod p. 3
2, 3, 5, 7, 11, 13, 17, 19, 29, 31, 37, 41, 43, 47, 53, 59, 61, 71, 73, 79, 83, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293 (list; graph; refs; listen; history; text; internal format)
OFFSET

1,1

LINKS

R. J. Mathar, Table of n, a(n) for n = 1..1000

Index entries for related sequences

MATHEMATICA

ok[p_]:= Reduce[Mod[x^11- 2, p] == 0, x, Integers]=!=False; Select[Prime[Range[200]], ok] (* Vincenzo Librandi, Sep 13 2012 *)

PROG

(PARI)

forprime(p=2, 2000, if([]~!=polrootsmod(x^11+2, p), print1(p, ", "))); print();

/* Joerg Arndt, Jun 24 2012 */

(MAGMA) [p: p in PrimesUpTo(400) | exists(t){x : x in ResidueClassRing(p) | x^11 eq 2}]; // Vincenzo Librandi, Sep 13 2012

CROSSREFS

Cf. A000040, A059241 (complement: x^11 = 2 has no solutions mod p).

Sequence in context: A255073 A008792 A094746 * A294200 A109997 A174144

Adjacent sequences:  A049540 A049541 A049542 * A049544 A049545 A049546

KEYWORD

nonn,easy

AUTHOR

N. J. A. Sloane.

STATUS

approved

Lookup | Welcome | Wiki | Register | Music | Plot 2 | Demos | Index | Browse | More | WebCam
Contribute new seq. or comment | Format | Style Sheet | Transforms | Superseeker | Recent
The OEIS Community | Maintained by The OEIS Foundation Inc.

License Agreements, Terms of Use, Privacy Policy. .

Last modified December 12 13:56 EST 2018. Contains 318063 sequences. (Running on oeis4.)