Pursuant to Divisible by n, prime vs. composite divisors, this problem requires you to write a function that determines divisibility for a large number (n_str) when the divisor is a composite. As was required in that problem, you will need to formulate the highest-power factorization of the divisor. Divisibility of n_str can then be determined by testing against each highest-power factor. For simplicity, this problem is restricted to numbers that contain the following as highest-power factors: 2, 3, 4, 5, 8, 9, and 10, as these divisibility tests are trivial. Their rules are included briefly below, for reference.
As an example, a number is divisible by 30 if it is divisible by 2, 3, and 5, as those are the highest-power factors for 30. Likewise, a number is divisible by 36 if it is divisible by 4 and 9 (not 3), as those are its highest-power factors.
The only restriction that remains is Java.
Previous problem: Divisible by n, Truncated-number Divisors.
1891 Solvers
244 Solvers
Golomb's self-describing sequence (based on Euler 341)
88 Solvers
262 Solvers
187 Solvers
Solution 2089110
I got tired of solving these problems. So, I just wrote a solution that works for everything.