document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=176731>Question 176731</A>: <I><SPAN STYLE=\"word-break: break-all;\"> find the least common multiple of 8, 21, and 24 </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #131794 by </B><A HREF=/tutors/aboutme.mpl?userid=Mathtut><B>Mathtut(3670)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=Mathtut><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=131794\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> 8=2*2*2<BR>\n" );
document.write( "21=3*7<BR>\n" );
document.write( "24=2*2*2*3<BR>\n" );
document.write( ":<BR>\n" );
document.write( "LCM=(2*2*2)*3*7=168<BR>\n" );
document.write( ":<BR>\n" );
document.write( "first find all the prime factors of each number.j<BR>\n" );
document.write( ":<BR>\n" );
document.write( "now from that compilation, you choose the prime which shows up the most times for any number that your trying to find the LCM for and you multiply all the highest occurrences of any one number together to find the LCM<BR>\n" );
document.write( ":<BR>\n" );
document.write( "in our problem 2 showed up in two of our numbers as a prime and the highest occurrence of 2 ways 2*2*2 or <IMG STYLE=\"max-width:80%;\" SRC=/cgi-bin/plot-formula.mpl?expression=2%5E3 ALIGN=MIDDLE  ALT=\"2%5E3\"   DISABLED_style= \"max-width:90%; height:auto;\" >. 3 showed up in two numbers but occurred only once in each and finally 7 was one of our primes and it occurred once. We took all those and multiplied them together to get the LCM </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );