Write a function to determine if a number is divisible by 12. Similar to the number six, this can be done by checking for divisibility of two numbers, in this case, divisibility by 3 and divisibility by 4. If the number passes both tests, it is also divisible by 12.
Previous problem: divisible by 11. Next problem: divisible by 13.
Solution Stats
Problem Recent Solvers78
Suggested Problems
-
Project Euler: Problem 7, Nth prime
471 Solvers
-
339 Solvers
-
336 Solvers
-
Create an index-powered vector
306 Solvers
-
183 Solvers
More from this Author139
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)
Problem Tags