A127437 Duplicate of A001915.

2, 5, 11, 13, 19, 23, 29, 37, 47, 53, 59, 61, 67, 71, 83, 97, 101, 107, 131, 139, 149, 163, 167, 173, 179, 181, 191, 193, 197, 211, 227, 239, 263, 269, 293, 307, 311, 313, 317, 347, 349, 359, 373, 379, 383, 389, 409, 419, 421, 431, 443, 461, 467, 479, 491, 499, 503, 509, 523, 541, 547, 557, 563, 577

Offset: 1

Author

Max Alekseyev, Jan 14 2007

Keywords

• dead

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.

Crossrefs

Cf. A050259, A123988 (complement in the primes).

Programs

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,", "); ))

Extensions

Corrected by Max Alekseyev, Jun 08 2011

Corrected by Arkadiusz Wesolowski, Jan 12 2021