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 Solvers260
Suggested Problems
-
Project Euler: Problem 3, Largest prime factor
1412 Solvers
-
Project Euler: Problem 6, Natural numbers, squares and sums.
2122 Solvers
-
920 Solvers
-
Set the array elements whose value is 13 to 0
1362 Solvers
-
calculate the length of matrix
1640 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!