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 Solvers281
Suggested Problems
-
The Goldbach Conjecture, Part 2
2420 Solvers
-
Project Euler: Problem 2, Sum of even Fibonacci
2915 Solvers
-
Sum of odd numbers in a matrix
622 Solvers
-
Matlab Basics II - Count rows in a matrix
412 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2240 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!
