\r\n" );
document.write( "Here is a proof using the binomial theorem.\r\n" );
document.write( "\r\n" );
document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "Every term of the binomial expansion of (8-1)2n\r\n" );
document.write( "except the last two terms contain a factor of 8 to a power\r\n" );
document.write( "2 or greater and thus they are all divisible by 64. So the\r\n" );
document.write( "above becomes upon writing out the first two and last two\r\n" );
document.write( "terms of the binomial expansion: \r\n" );
document.write( "\r\n" );
document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "Simplifying and using the property of combinations C(2n,2n-1)=C(2n,1)=2n\r\n" );
document.write( "\r\n" );
document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "
\r\n" );
document.write( "\r\n" );
document.write( "The last two terms in the binomial expansion cancel with the \r\n" );
document.write( "16n-1, so all the remaining terms are divisible by 64. Thus \r\n" );
document.write( "the theorem is proved.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" );
document.write( "