Pursuant to the first problem in this series, this one involves checking for divisibility by 9.
Write a function to determine if a number is divisible by 9. This can be done by the following method:
- Sum the digits of the number. As with methods for other numbers, this summing step can be applied recursively until a single-digit number results. If the resulting number is divisible by nine, then so is the original number.
Previous problem: divisible by 8. Next problem: divisible by 10.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers280
Suggested Problems
-
Remove any row in which a NaN appears
8790 Solvers
-
2193 Solvers
-
Convert a numerical matrix into a cell array of strings
2534 Solvers
-
Back to basics 22 - Rotate a matrix
939 Solvers
-
Divisible by n, prime vs. composite divisors
115 Solvers
More from this Author139
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
