proposed
approved
proposed
approved
editing
proposed
(PARI) isok(k) = my(d=divisors(k)); #Set(apply(sumdigits, d)) == #d; \\ Michel Marcus, Dec 19 2022
proposed
editing
editing
proposed
(Python)
from sympy import divisors
def sod(n): return sum(map(int, str(n)))
def ok(n):
s = set()
for d in divisors(n, generator=True):
sd = sod(d)
if sd in s: return False
s.add(sd)
return True
print([k for k in range(1, 98) if ok(k)]) # Michael S. Branicky, Dec 15 2022
allocated for Stefano SpeziaNumbers that do not have two divisors with an equal sum of digits.
1, 2, 3, 4, 5, 6, 7, 8, 9, 11, 13, 14, 15, 16, 17, 19, 23, 25, 26, 28, 29, 31, 32, 33, 34, 35, 37, 38, 39, 41, 43, 46, 47, 49, 51, 53, 55, 56, 57, 58, 59, 61, 62, 64, 65, 67, 68, 69, 71, 73, 74, 75, 76, 77, 78, 79, 82, 83, 85, 86, 87, 89, 91, 92, 93, 94, 95, 97
1,2
a={}; For[k=1, k<=97, k++, If[Length[Intersection[Table[Total[Part[IntegerDigits[Divisors[k]], i]], {i, DivisorSigma[0, k]}]]]==DivisorSigma[0, k], AppendTo[a, k]]]; a
allocated
nonn,base
Stefano Spezia, Dec 15 2022
approved
editing
allocated for Stefano Spezia
allocated
approved