Write a function to determine if a number is divisible by 15. If a number is divisible by 3 and divisible by 5, then it is divisible by 15.
Previous problem: divisible by 14. Next problem divisible by 16.
welcome to 20000 club
Thank you :)
Shortest solution (so far) that keeps to the spirit of the challenge. Code is also easy to read.
Another short solution that keeps to the spirit of the challenge.
So many choices
Project Euler: Problem 7, Nth prime
Find a subset that divides the vector into equal halves
Reverse the elements of an array
03 - Matrix Variables 3
Approximation of Pi (vector inputs)
Mersenne Primes vs. All Primes
Divisible by n, prime divisors (including powers)
Scrabble Scores - 4
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