document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=344032>Question 344032</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Jim and his study group want to know if 601 is a prime or composite number. He explained to his group that neither 2,3,4 nor 5 were factors of 601 by using divisibilty rules. Mary claims that they did not have to check 4 since they all ready knew 2 was not a factor, but Jim disagreed. Jim claimed that it was possible for 4 to be a factor of a number even if 2 wasnt.\r<BR>\n" );
document.write( "\n" );
document.write( "Is jims claim correct? Explain?\r<BR>\n" );
document.write( "\n" );
document.write( "List all of the prime numbers you would check to see if they were factors when trying to determine if 601 is a prime or composite number. Explain why your list is complete and efficent. </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #246161 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=246161\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Jim and his study group want to know if 601 is a prime or composite number. He explained to his group that neither 2,3,4 nor 5 were factors of 601 by using divisibilty rules. Mary claims that they did not have to check 4 since they all ready knew 2 was not a factor, but Jim disagreed. Jim claimed that it was possible for 4 to be a factor of a number even if 2 wasnt. <BR>\n" );
document.write( "Is jims claim correct? No, Jim is wrong. <BR>\n" );
document.write( "Explain?  If any number is divisible by 4, it's 4*n.  4n is divisible by 2.<BR>\n" );
document.write( "All even factors can be crossed off if it's not divisible by 2.<BR>\n" );
document.write( "-----------------------------------------------<BR>\n" );
document.write( "List all of the prime numbers you would check to see if they were factors when trying to determine if 601 is a prime or composite number. Explain why your list is complete and efficent.<BR>\n" );
document.write( "You need to try all prime numbers < sqrt(601).<BR>\n" );
document.write( "2,3,5,7,11,13,17,19,23 and 29<BR>\n" );
document.write( "It's not necessary to try prime numbers higher that sqrt(601), because any divisor more than that would give a quotient less than sqrt(601), which you've already tried.<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );