OFFSET
1,1
COMMENTS
See A234849 for more information about MD5.
This sequence is probably infinite, because MD5 returns a fixed-length output, but we don't know if outputs containing only decimal digits appear infinitely many times. Even if this is the case, it would not be enough, as we would not know if this holds when we consider the input as a number (interpreted as a string).
LINKS
Michael S. Branicky, Table of n, a(n) for n = 1..10000
Wikipedia, MD5
EXAMPLE
a(1) = 1518375, because 1518375 is the smallest k >= 0 such that MD5(k) contains only decimal digits: MD5("1518375") = "93240121540327474319550261818423".
MATHEMATICA
Monitor[Do[If[!StringContainsQ[Hash[ToString@k, "MD5", "HexString"], Alphabet[]], Print@k], {k, 10^9}], k] (* Giorgos Kalogeropoulos, Jul 28 2021 *)
PROG
(Python)
from hashlib import md5
i=0
while True:
m = md5()
m.update(str(i).encode('utf-8'))
result = m.hexdigest()
if result.isdecimal():
print(i)
i+=1
CROSSREFS
KEYWORD
easy,nonn,base
AUTHOR
Eder Vanzei, Jul 28 2021
STATUS
approved