document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=472545>Question 472545</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Among all pairs of numbers whose sum is 26, find a pair whose product is as large as possible. What is the maximum product? </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #323967 by </B><A HREF=/tutors/aboutme.mpl?userid=richard1234><B>richard1234(7193)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=richard1234><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=richard1234><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=323967\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> {13,13}, maximum product is 169. There are several ways to prove this.\r<BR>\n" );
document.write( "<BR>\n" );
document.write( "\n" );
document.write( "Let a, 26-a be the two numbers, in which we want to maximize a(26-a). We can either use the fact that it is quadratic in terms of a and find the vertex, or use the AM-GM inequality. Both methods yield a = 13 maximizing the product. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );