Problem 45767. Prime number check (★★)

Anirban Pal

54 solvers

1 likes

Solve

Solve Later

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.

Solve

Solution Stats

111 Solutions

Last Solution submitted on Apr 07, 2026

Last 200 Solutions

Problem Comments

Solution Comments

Show comments

Problem Recent Solvers54

Suggested Problems

Sum of the Matrix Elements

601 Solvers
Matlab Basics - Set unwanted parts of a vector to zero

261 Solvers
y equals x divided by 2

542 Solvers
Divide by 4

1215 Solvers
Create a square matrix of zeros of even order

187 Solvers

More from this Author52

Matrix indexing with two vectors of indices (★★)

41 Solvers
Average of corner elements of a matrix (★★)

86 Solvers
Select every other element of a vector (★★)

111 Solvers
Reindex a vector (★★)

56 Solvers
Matrix with increasing numbers (★★★★)

31 Solvers

Problem Tags

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!