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.
Implement a ROT13 cipher
Number of Horns on a unicorn!
Back to basics - mean of corner elements of a matrix
Scrabble Scores - 12
5 Prime Numbers
Not square-free number sequence
Lights Out 1 - 5x5, 3 moves
Divisible by 9
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: .
You can also select a web site from the following list:
Select the China site (in Chinese or English) for best site performance. Other MathWorks country sites are not optimized for visits from your location.
Contact your local office