|
|
A057839
|
|
Numbers k such that k | 10^k + 8^k + 6^k + 4^k + 2^k + 1.
|
|
0
|
|
|
|
OFFSET
|
1,2
|
|
LINKS
|
|
|
MATHEMATICA
|
Select[ Range[ 10^6 ], Mod[ PowerMod[ 10, #, # ] + PowerMod[ 8, #, # ] + PowerMod[ 6, #, # ] + PowerMod[ 4, #, # ] + PowerMod[ 2, #, # ] + 1, # ] == 0 & ]
|
|
PROG
|
(Python)
def afind(limit):
for k in range(1, limit+1, 2):
if (1 + sum(pow(e, k, k) for e in [2, 4, 6, 8, 10])) % k == 0:
print(k, end=", ")
(PARI) is_ok(k)=(sum(j=1, 5, Mod(2*j, k)^k) + 1)==0; \\ Joerg Arndt, Apr 02 2021
|
|
CROSSREFS
|
|
|
KEYWORD
|
nonn,more
|
|
AUTHOR
|
|
|
EXTENSIONS
|
|
|
STATUS
|
approved
|
|
|
|