document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=44027>Question 44027</A>: <I><SPAN STYLE=\"word-break: break-all;\"> It is a fact that if an N is a composite number, then there exists a prime <BR>\n" );
document.write( "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?<BR>\n" );
document.write( "How did you come up with the answer? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #29102 by </B><A HREF=/tutors/aboutme.mpl?userid=fractalier><B>fractalier(6550)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=fractalier><IMG SRC=http://www.algebra.com/images/aboutme-small.gif BORDER=0 alt=\"About Me\" VALIGN=MIDDLE></A>&nbsp;<IMG SRC=http://www.algebra.com/cgi-bin/show-face.mpl?user=fractalier><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=29102\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> 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<BR>\n" );
document.write( "2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, and 43<BR>\n" );
document.write( "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<BR>\n" );
document.write( "14 prime numbers </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );