Minimum multiple of m where digital sum equals m: Difference between revisions

=={{header|Julia}}==

<lang julia>minproddigsum(n) = findfirst(i -> sum(digits(n * i)) == n, 1:typemax(Int32))

for j in 1:70

print(lpad(minproddigsum(j), 10), j % 7 == 0 ? "\n" : "")

end

</lang>{{out}}

<pre>

1 1 1 1 1 1 1

1 1 19 19 4 19 19

13 28 28 11 46 199 19

109 73 37 199 73 37 271

172 1333 289 559 1303 847 1657

833 1027 1576 1282 17497 4339 2119

2323 10909 11111 12826 14617 14581 16102

199999 17449 38269 56413 37037 1108909 142498

103507 154981 150661 1333333 163918 322579 315873

937342 1076923 1030303 880597 1469116 1157971 12842857

</pre>