document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=209585>Question 209585</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Is the LCM of two numbers always divisible by the GCF of the two numbers? If so why. If not give an example </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #158548 by </B><A HREF=/tutors/aboutme.mpl?userid=RAY100><B>RAY100(1637)</B></A><img src=\"/images/stars/stars-12.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=RAY100><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=158548\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Given  two  numbers,  the  GCF  is  the  lower  power  of  common  prime  factors<BR>\n" );
document.write( ".<BR>\n" );
document.write( "and  the  LCM,  is the  greater  power  of common  prime  factors.<BR>\n" );
document.write( ".<BR>\n" );
document.write( "Since  common factors  are  divided  by  common  factors,  division  is  possible<BR>\n" );
document.write( ".<BR>\n" );
document.write( "for  example,,,,20,and  30<BR>\n" );
document.write( ".<BR>\n" );
document.write( "Prime  factorization  is,,,,2^2*5,,,2*3*5,,,respectively<BR>\n" );
document.write( ".<BR>\n" );
document.write( "GCF = 2*5=10<BR>\n" );
document.write( ".<BR>\n" );
document.write( "LCM = 2^2 *3*5 =60<BR>\n" );
document.write( ".<BR>\n" );
document.write( "LCM/GCF = 60/10 =6<BR>\n" );
document.write( ".<BR>\n" );
document.write( " </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );