document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=149637>Question 149637</A>: <I><SPAN STYLE=\"word-break: break-all;\"> how do you find prime factors </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #109784 by </B><A HREF=/tutors/aboutme.mpl?userid=vleith><B>vleith(2983)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=vleith><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/images/nopicture.jpg><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=109784\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Here's how I do it. <BR>\n" );
document.write( "If the number is even, I try dividing by 2. I keep doing that until I get an odd factor.<BR>\n" );
document.write( "I take the result of the disivions by 2 and use that to try the next prime number.\r<BR>\n" );
document.write( "\n" );
document.write( "If the number is odd, I look to see if the sum of the digits in the number is divisible by three. If it is, then th original number is disivible by three. I do that until dividing by three leaves a non-integer remainder.\r<BR>\n" );
document.write( "\n" );
document.write( "I then try 5, then 7, then 11. I keep going up the prime numbers until such time as the square of the prime number I am currently using is larger than the number I am trying to divide into.\r<BR>\n" );
document.write( "\n" );
document.write( "Then I check my results here --> <BR>\n" );
document.write( "http://www.mathwarehouse.com/arithmetic/numbers/prime-number/prime-factorization-calculator.php </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );