Problem 45767. Prime number check (★★)
One way to see if a number x is prime is to compute the remainders obtained when dividing x by all integers from 2 to √(x). If x is prime, then all remainders will be non-zero.
For example, if x = 35 then √(x)=5.916, and the set of divisors from 2 to √(x) are [2 3 4 5]. The remainders obtained when dividing 35 by 2,3,4,5 are 1,2,3,0 respectively. Since one of the remainders is 0, the number x is not prime.
Write a function that will compute the remainders obtained when dividing x by all integers from 2 to √(x).
Avoid using for/while loops.
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers42
Suggested Problems
-
Replace multiples of 5 with NaN
432 Solvers
-
406 Solvers
-
Determine the length of a string of characters
248 Solvers
-
439 Solvers
-
Convert from Fahrenheit to Celsius
21793 Solvers
More from this Author52
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!