document.write( "<A HREF=/cgi-bin/jump-to-question.mpl?question=1044530>Question 1044530</A>: <I><SPAN STYLE=\"word-break: break-all;\"> Prove that 7^(2n)+16n-1 is divisible by 64 </SPAN>\n" );
document.write( "</I><HR><TABLE width=100%><TR><TD><B><A HREF=http://www.algebra.com/>Algebra.Com's</A> Answer #659835 by </B><A HREF=/tutors/aboutme.mpl?userid=oscargut><B>oscargut(2103)</B></A><img src=\"/images/stars/stars-13.gif\" alt=\"\" >&nbsp;<A HREF=/tutors/aboutme.mpl?userid=oscargut><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=oscargut><BR>You can <A HREF=\"/cgi-bin/embed-solution.mpl?show=1&solution=659835\">put this solution on YOUR website!</A><BR><SPAN STYLE=\"word-break: break-all;\"> Proof is by induction:\r<BR>\n" );
document.write( "\n" );
document.write( "Basis Step : If n=1\r<BR>\n" );
document.write( "\n" );
document.write( "7^(2n)+16n-1  =  7^(2)+16-1 = 49+16-1 = 64 (divisible by 64)\r<BR>\n" );
document.write( "\n" );
document.write( "Inductive step:  \r<BR>\n" );
document.write( "\n" );
document.write( "H)  7^(2n)+16n-1 is divisible by 64\r<BR>\n" );
document.write( "\n" );
document.write( "T)  7^(2(n+1))+16(n+1)-1 is divisible by 64\r<BR>\n" );
document.write( "\n" );
document.write( "If you need more help you can contact me at mthman@gmail.com\r<BR>\n" );
document.write( "\n" );
document.write( "Thanks </SPAN>\n" );
document.write( "</TD></TR></TABLE>\n" );