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
Recent Solvers109
Suggested Problems
-
The Goldbach Conjecture, Part 2
921 Solvers
-
705 Solvers
-
Back to basics 19 - character types
185 Solvers
-
Reverse the elements of an array
496 Solvers
-
542 Solvers
More from this Author161
Tags
Select a Web Site
Choose a web site to get translated content where available and see local events and offers. Based on your location, we recommend that you select: .
Select web siteYou can also select a web site from the following list:
Americas
- América Latina (Español)
- Canada (English)
- United States (English)
Europe
- Belgium (English)
- Denmark (English)
- Deutschland (Deutsch)
- España (Español)
- Finland (English)
- France (Français)
- Ireland (English)
- Italia (Italiano)
- Luxembourg (English)
- Netherlands (English)
- Norway (English)
- Österreich (Deutsch)
- Portugal (English)
- Sweden (English)
- Switzerland
- United Kingdom (English)