SOLUTION: how can it be easy to know if a number is prime

Algebra ->  Divisibility and Prime Numbers -> SOLUTION: how can it be easy to know if a number is prime      Log On


   

Question 913107: how can it be easy to know if a number is prime
Answer by richard1234(7193) About Me  (Show Source):
You can put this solution on YOUR website!
A simple method is to divide your integer n by every prime from 2 up to , and if your quotient is an integer for some divisor, n is not prime. If you do obtain an integer quotient, stop. (because you know n is composite)