Divide the number by greatest divisible powers of 2, 3 and 5, if the number becomes 1 then it is an ugly number otherwise not. Follows functional programming practices POC for python logging ...

Take a number and check each digit if it is divisible by the digit on its left checked and return an array of booleans. The booleans should always start with false becase there is no digit before the ...