Intended for: July 6, 2012
Timetable
- First draft entered by Alonso del Arte on March 7, 2011 based on an almost verbatim copy of a write-up by David W. Wilson from October 23, 2010. ✓
- Draft reviewed by Alonso del Arte on March 24, 2012 ✓
- Draft approved by Daniel Forgues on June 6, 2015 ✓
The line below marks the end of the <noinclude> ... </noinclude> section.
A036236: Least inverse of
A015910: smallest integer
such that
or
0 if no such
exists.
-
{ 1, 0, 3, 4700063497, 6, 19147, 10669, 25, ... }
Fermat’s little theorem says that
for odd prime
, and on some random day long ago I got to wondering what values
might take for other
. I did some experimenting and found that that for small
,
took on many small values, but
1 and
3 remained elusive. I asked about them on the
seqfan list, and found that
is provably insoluble, while
D. H. Lehmer had found the impressively large minimal solution
for
, an impressively large solution for such a simple identity.
Joe K. Crump has done some amazing work with this sequence, see
.