A050259 and a new solution to 2^n = 3 (mod n)
Rainer Rosenthal
r.rosenthal at web.de
Mon Nov 13 23:12:57 CET 2006
Richard Guy wrote:
> Congratulations! May I know Max's full name,
> so that he can earn undying fame in UPINT as
> well as in OEIS ? Thanks, R.
>
> On Mon, 13 Nov 2006, Max A. wrote:
>>In course of exploring all solutions of the congruence 2^n = 3
>>(mod n) below 10^16, I have found a new solution:
>>
>>n = 3468371109448915
>>P.S. See also http://mathworld.wolfram.com/2.html
This is a lovely finding, which I will have to tell
immediately in the German Newsgroup de.sci.mathematik.
Congratulations from a friend of OEIS and UPINT and
of things that are not too difficult to comprehend :-)
Not only congratulations to Max for finding, but to all
of us for being witnesses.
Best regards,
Rainer Rosenthal
r.rosenthal at web.de
More information about the SeqFan
mailing list