Pursuant to the first problem in this series, this one involves checking for divisibility by 6.
Write a function to determine if a number is divisible by 6. This can be done by checking for divisibility by 2 and divisibility by 3. If the number passes both tests, it is also divisible by 6.
Previous problem: divisible by 5. Next problem: divisible by 7.
Solution Stats
Problem Recent Solvers112
Suggested Problems
-
Project Euler: Problem 4, Palindromic numbers
125 Solvers
-
1330 Solvers
-
224 Solvers
-
Integer Sequence - II : New Fibonacci
147 Solvers
-
208 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