Problem 42411. Divisible by 9
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 commentsProblem Recent Solvers275
Suggested Problems
-
Sum all integers from 1 to 2^n
17311 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2528 Solvers
-
Sum of diagonal of a square matrix
1627 Solvers
-
978 Solvers
-
the average value of the elements
2177 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!