|
| |
|
|
A372771
|
|
Numbers m such that the congruence x^(m+1) == m (mod m+1) is solvable.
|
|
1
|
|
|
|
1, 2, 4, 6, 8, 9, 10, 12, 14, 16, 18, 20, 22, 24, 25, 26, 28, 30, 32, 33, 34, 36, 38, 40, 42, 44, 46, 48, 49, 50, 52, 54, 56, 57, 58, 60, 62, 64, 66, 68, 70, 72, 73, 74, 76, 78, 80, 81, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 105, 106, 108, 110
(list;
graph;
refs;
listen;
history;
text;
internal format)
|
|
|
|
OFFSET
|
1,2
|
|
|
LINKS
|
|
|
|
EXAMPLE
|
9 is a term because x^(9+1) == 9 (mod 9+1) for x = 3 and x = 7, i.e., 3^10 = 59049 == 9 (mod 10) and 7^10 = 282475249 == 9 (mod 10).
|
|
|
MATHEMATICA
|
Select[Range[1, 110], With[{m = #}, AnyTrue[Range[1, m + 1], PowerMod[#, m + 1, m + 1] == m &]] &] (* Robert P. P. McKone, May 14 2024 *)
|
|
|
CROSSREFS
|
|
|
|
KEYWORD
|
nonn
|
|
|
AUTHOR
|
|
|
|
EXTENSIONS
|
|
|
|
STATUS
|
approved
|
| |
|
|
