|
| |
|
|
A127437
|
|
Primes p such that 2^x = 3 (mod p) has a solution.
|
|
3
| |
|
|
2, 5, 11, 13, 19, 23, 29, 37, 53, 59, 61, 67, 83, 101, 107, 131, 139, 149, 163, 173, 179, 181, 197, 211, 227, 269, 293, 317, 347, 349, 373, 379, 389, 419, 421, 443, 461, 467, 491, 509, 523, 541, 547, 557, 563, 587, 613, 619, 653, 659, 661, 677, 701, 709, 757, 773, 787, 797, 821, 827, 829, 853, 859, 877, 883, 907, 941, 947
(list; graph; refs; listen; history; internal format)
|
|
|
|
OFFSET
| 1,1
|
|
|
COMMENTS
| Potential prime divisors of solutions to 2^m = 3 (mod m) (see A050259).
Minimal nonnegative solutions to 2^x = 3 (mod a(n)) are given in A127438.
|
|
|
PROG
| (PARI) forprime(p=5, 1000, g=znprimroot(p); u=znlog(Mod(2, p), g); v=znlog(Mod(3, p), g); if( v%u==0, print1(p, ", "); ))
|
|
|
CROSSREFS
| Cf. A050259, A123988 (complement in the primes)
Sequence in context: A194854 A045360 A001915 * A084792 A109640 A191048
Adjacent sequences: A127434 A127435 A127436 * A127438 A127439 A127440
|
|
|
KEYWORD
| nonn
|
|
|
AUTHOR
| Max Alekseyev, Jan 14 2007
|
|
|
EXTENSIONS
| Corrected by Max Alekseyev (maxale(AT)gmail.com), Jun 08 2011
|
| |
|
|
