Largest number divisible by its digits: Difference between revisions

m
(→‎Haskell Base 10: Derived the lcm of [1, 2, 3, 4, 6, 7, 8, 9] explicitly, rather than assuming it)
Line 41:
(comparing
(\x ->
if rem x lcmDigits == 0 -- Checking for divisibility by (7*8*9)all digits
then x
else 0))
9,655

edits