document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=172928>Question 172928</A>: <I><SPAN STYLE=\"word-break: break-all;\"> what is the \"GCF\" of the following:\r<BR>\n" );
document.write( "\n" );
document.write( "16,22\r<BR>\n" );
document.write( "\n" );
document.write( "18,26\r<BR>\n" );
document.write( "\n" );
document.write( "15,25\r<BR>\n" );
document.write( "\n" );
document.write( "30,75\r<BR>\n" );
document.write( "\n" );
document.write( "15,30\r<BR>\n" );
document.write( "\n" );
document.write( "72,108\r<BR>\n" );
document.write( "\n" );
document.write( "24,60\r<BR>\n" );
document.write( "\n" );
document.write( "36,80 </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #127774 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=127774\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> I'll do the first few using a detailed process. You can do the rest.\r<BR>\n" );
document.write( "\n" );
document.write( "IN order to find the Greatest Common factor, you need to find the prime factors that make up each term. Here is a tool to help you check your ability to find prime factor --> http://www.virtuescience.com/prime-factor-calculator.html\r<BR>\n" );
document.write( "\n" );
document.write( "16 = 2*2*2*2<BR>\n" );
document.write( "22 = 2* 11<BR>\n" );
document.write( "Each has a common factor of 2 -- and nothing more. So the GCF = 2\r<BR>\n" );
document.write( "\n" );
document.write( "18 = 2* 3 * 3<BR>\n" );
document.write( "26 = 2* 13<BR>\n" );
document.write( "Again, only 2 is common. GCF =2\r<BR>\n" );
document.write( "\n" );
document.write( "Skipping down a bit<BR>\n" );
document.write( "15 = 3 * 5<BR>\n" );
document.write( "30 = 2 * 3 * 5<BR>\n" );
document.write( "In this case, each one contains both a 3 and a 5. so the GCF = 3*5 = 15\r<BR>\n" );
document.write( "\n" );
document.write( "Skipping to the last one<BR>\n" );
document.write( "36 = 2 * 2 * 3 * 3<BR>\n" );
document.write( "80 = 2 * 2 * 2 * 2 * 5<BR>\n" );
document.write( "Both contain 2 * 2, so the GCF = 4\r<BR>\n" );
document.write( "\n" );
document.write( "Get the process?\r<BR>\n" );
document.write( "\n" );
document.write( "Now, you won't be able to use the calculator on a test. You need to get a prime factorization by hand.<BR>\n" );
document.write( "I always look for even numbers. I divide by 2. If the resulting quotient is even, I divide by 2 again. Keep dividing by 2 until the result is odd.\r<BR>\n" );
document.write( "\n" );
document.write( "Then try 3 (if the sum of the digits if a number is divisible by 3, then the number is also divisible by three)\r<BR>\n" );
document.write( "\n" );
document.write( "Then do 5 (five is easy too. The ones digit is either 0 or 5)\r<BR>\n" );
document.write( "\n" );
document.write( "Keep walking up the prime numbers <BR>\n" );
document.write( "2, 3, 5, 7, 11, 13, 17, 19 ....\r<BR>\n" );
document.write( "\n" );
document.write( "Then use hat URL to check yourself\r<BR>\n" );
document.write( "\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );