document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=913107>Question 913107</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how can it be easy to know if a number is prime </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #554289 by </B><A HREF=/tutors/aboutme.mpl?userid=richard1234><B>richard1234(7193)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=richard1234><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=richard1234><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=554289\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> A simple method is to divide your integer n by every prime from 2 up to <IMG STYLE=\"max-width:80%;\" SRC=\"/cgi-bin/rendertex.cgi?\large \lfloor \sqrt{n} \rfloor\">, 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) </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );