SOLUTION: It is a fact that if an N is a composite number, then there exists a prime p is less than or equal to sqrt(N) which is a factor of N. Given this, how many primes must be checked

Question 44027: It is a fact that if an N is a composite number, then there exists a prime
p is less than or equal to sqrt(N) which is a factor of N. Given this, how many primes must be checked to determine if 2003 is prime?
How did you come up with the answer?
Answer by fractalier(6550) (Show Source): You can put this solution on YOUR website!
Well, let's see...the square root of 2003 is about 44 and change, so we try all the primes less than that...they would be
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, and 43
Of course we can see that 2 doesn't work, since 2003 is odd, but that is not what the question asks...the answer is
14 prime numbers
RELATED QUESTIONS
Prove that nCr is less than or equal to n+1Cr+1 . Hint: Make use of the fact that if A (answered by richard1234)

For a positive integer $n$, $\phi(n)$ denotes the number of positive integers less than... (answered by ikleyn,math_tutor2020)

For each statement,state whether it is always,sometimes,or never true, and briefly... (answered by KMST)

If you add a prime number to itself,is the sum composite or prime?... (answered by solver91311)

How to see that a complete subfield F in Q_p with absolute value | |_p, is actually Q_p... (answered by textot)

Let n be a positive integer, k the number of prime numbers less than or equal to n, and... (answered by richard1234)

(a) Let p be a prime number greater than 3. What are the possible remainders of p upon... (answered by jim_thompson5910)

if n is an integer greater then 1, such that n divided by 4 yields a remainder of 0,... (answered by tommyt3rd)

Suppose a >= 2 and n is a natural number larger than 1. How can I prove that if n is... (answered by math_tutor2020,ikleyn)