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 Solvers277
Suggested Problems
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1307 Solvers
-
Numbers with prime factors 2, 3 and 5.
682 Solvers
-
658 Solvers
-
5171 Solvers
-
Converts numbers into characters
2044 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!