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
Problem Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers58
Suggested Problems
-
48329 Solvers
-
9193 Solvers
-
Back to basics 22 - Rotate a matrix
942 Solvers
-
Number of 1s in a binary string
11725 Solvers
-
Change the first and last diagonal element of the identity matrix to zero
161 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!