Pursuant to the first problem in this series, this one involves checking for divisibility by 10.
Write a function to determine if a number is divisible by 10. This can be done by checking if the last digit is zero.
Previous problem: divisible by 9. Next problem: divisible by 11.
Solution Stats
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers379
Suggested Problems
-
Project Euler: Problem 7, Nth prime
1773 Solvers
-
503 Solvers
-
484 Solvers
-
350 Solvers
-
the average value of the elements
2373 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!