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
-
Given an unsigned integer x, find the largest y by rearranging the bits in x
1658 Solvers
-
494 Solvers
-
07 - Common functions and indexing 2
405 Solvers
-
1172 Solvers
-
320 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!