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 Solvers275
Suggested Problems
-
Find all elements less than 0 or greater than 10 and replace them with NaN
15778 Solvers
-
Sort a list of complex numbers based on far they are from the origin.
5793 Solvers
-
2371 Solvers
-
3402 Solvers
-
Project Euler: Problem 4, Palindromic numbers
1265 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!
