|
Search: id:A050259
|
|
|
| A050259 |
|
Numbers n such that 2^n == 3 (mod n). |
|
+0
16
|
| |
|
|
OFFSET
|
1,2
|
|
|
COMMENT
|
Other elements of this sequence: 3468371109448915 (Max Alekseyev), 8365386194032363 and 10991007971508067 (Joe K. Crump), 63130707451134435989380140059866138830623361447484274774099906755 (P.-L. Montgomery).
a(2) was first computed by the Lehmers.
|
|
LINKS
|
Joe K. Crump, 2^n mod n
Eric Weisstein's World of Mathematics, Link to a section of The World of Mathematics.
|
|
CROSSREFS
|
Cf. A036236, A015940.
Sequence in context: A034916 A124977 A128172 this_sequence A015384 A072018 A017409
Adjacent sequences: A050256 A050257 A050258 this_sequence A050260 A050261 A050262
|
|
KEYWORD
|
nonn,more,hard
|
|
AUTHOR
|
Eric Weisstein (eric(AT)weisstein.com)
|
|
EXTENSIONS
|
Comment from Max Alekseyev, Jan 27 2007: I have finished exploration of all solutions below 10^16. No new solutions were found. So now we can say what the first four terms are.
a(1)-a(4) certified by Max Alekseyev, Jan 27 2007 (see comments above).
|
|
|
Search completed in 0.002 seconds
|
