document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=990013>Question 990013</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Two scout troops are camping.  One troop has 40 members  and the other 48 members.  The scout masters want to divide them into groups.  How can the scouts of the two troops be grouped so that each group has the biggest number possible of scouts and each group has the same number of scouts with no scouts left out? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #802309 by </B><A HREF=/tutors/aboutme.mpl?userid=CubeyThePenguin><B>CubeyThePenguin(3113)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=CubeyThePenguin><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=CubeyThePenguin><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=802309\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> We are finding the GCD (greatest common divisor) of 40 and 48.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "40 = 2^3 * 5<BR>\n" );
document.write( "48 = 2^4  *3\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "GCD(40, 48) = 2^3 = 8 </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );