document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=161114>Question 161114</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Determine whether the folowing interger is prime or a composite by dividing by prime numbers.  If the integer is composite, find at least 2 pairs of factors whose product is the integer.\r<BR>\n" );
document.write( "\n" );
document.write( "823\r<BR>\n" );
document.write( "\n" );
document.write( "This is not in a Textbook.  On a disk.  \r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #120859 by </B><A HREF=/tutors/aboutme.mpl?userid=Alan3354><B>Alan3354(69443)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Alan3354><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=Alan3354><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=120859\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Determine whether the folowing interger is prime or a composite by dividing by prime numbers. If the integer is composite, find at least 2 pairs of factors whose product is the integer. <BR>\n" );
document.write( "823 <BR>\n" );
document.write( "-----------------<BR>\n" );
document.write( "If you divide it by all prime numbers from 2 to 29, you'll see if it's evenly divisible by any of them.<BR>\n" );
document.write( "Try 2, 3, 7, 11, 13, 17, 19, 23, and 29.  That's only 9 to try. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );