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
-
501 Solvers
-
Project Euler: Problem 5, Smallest multiple
1649 Solvers
-
middleAsColumn: Return all but first and last element as a column vector
647 Solvers
-
Determine Whether an array is empty
811 Solvers
-
find the maximum element of the matrix
537 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!