document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=45681>Question 45681</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Can someone help me on this?\r<BR>\n" );
document.write( "\n" );
document.write( "  I need to find the LCM (least common multiple) for each of the following group of numbers:\r<BR>\n" );
document.write( "\n" );
document.write( "  8, 15, and 20\r<BR>\n" );
document.write( "\n" );
document.write( "  Thanks,<BR>\n" );
document.write( "  Sher </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #30354 by </B><A HREF=/tutors/aboutme.mpl?userid=stanbon><B>stanbon(75887)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=stanbon><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=30354\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> LCM of 8,15, and 20 \r<BR>\n" );
document.write( "\n" );
document.write( "Method for finding LCM.<BR>\n" );
document.write( "1. convert each number to its prime-factor form, as follows:<BR>\n" );
document.write( "8=2*2*2<BR>\n" );
document.write( "15=3*5<BR>\n" );
document.write( "20=2*2*5\r<BR>\n" );
document.write( "\n" );
document.write( "2. The LCM must contain each prime factor to the highest<BR>\n" );
document.write( "power indicated, as follows:<BR>\n" );
document.write( "2 must be there are 2^3<BR>\n" );
document.write( "3 must be there as 3<BR>\n" );
document.write( "5 must be there as 5\r<BR>\n" );
document.write( "\n" );
document.write( "3. Find the product of these, as follows:<BR>\n" );
document.write( "2^3*3*5 = 8*15= 120<BR>\n" );
document.write( "That is the LCM of 8, 15, and 20\r<BR>\n" );
document.write( "\n" );
document.write( "Cheers,<BR>\n" );
document.write( "Stan H. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );