document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1035673>Question 1035673</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Identify the correct base case for a proof by induction for the following statement.<BR>\n" );
document.write( "1+3+5+...+(2n-1)=n(n+1)/2 </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #650322 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=650322\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> A good choice of base case is n = 1. </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );