Write times_divisible(n, d) that returns how many times n can be divided by d with no remainder (n > 0, d > 1).
times_divisible(48, 2) → 4
times_divisible(7, 2) → 0
Submit runs 4 tests, including hidden edge cases.
Each hint gives a little more help. Try on your own first.
Run your code to see the output here.