document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=172844>Question 172844</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Find two positive numbers with product of 64 and the sum that is minimum </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #127703 by </B><A HREF=/tutors/aboutme.mpl?userid=solver91311><B>solver91311(24713)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=solver91311><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=solver91311><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=127703\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> The prime factorization of 64 is <IMG STYLE=\"max-width:80%;\" SRC=/cgi-bin/plot-formula.mpl?expression=2%5E6 ALIGN=MIDDLE  ALT=\"2%5E6\"   DISABLED_style= \"max-width:90%; height:auto;\" >, so all factors of 64 must be some power of 2.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Possible factors:  1, 2, 4, 8, 16, 32, and 64.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "64 * 1 = 64, sum is 65\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "32 * 2 = 64, sum is 34\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "16 * 4 = 65, sum is 20\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "8 * 8 = 64, sum is 16\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Your problem doesn't say that the numbers have to be different, so 8 and 8 are the correct choices.  If you add the restriction that the numbers must be different, then the answer is 4 and 16. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );