document.write( "Question 1183173: Hello this is a mathematical induction prove question I need help with.
\n" ); document.write( "
\n" ); document.write( "1. Show that, for every positive integer n:
\n" ); document.write( "1 + 2 + 2^2 + 2^3 + … + 2^(n-1) = 2^n - 1
\n" ); document.write( "

Algebra.Com's Answer #813350 by Edwin McCravy(20059)\"\" \"About 
You can put this solution on YOUR website!
\r\n" );
document.write( "\r\n" );
document.write( "\"1+%2B+2+%2B+2%5E2+%2B+2%5E3+%2B+%22%22%2A%22%22%2A%22%22%2A%22%22+%2B+2%5E%28n-1%29\"\"%22%22=%22%22\"\"2%5En+-+1\"\r\n" );
document.write( "\r\n" );
document.write( "We show that it's true for n=1.\r\n" );
document.write( "\r\n" );
document.write( "\"1\"\"%22%22=%22%22\"\"2%5E1-1\"\"%22%22=%22%22\"\"2-1\"\"%22%22=%22%22\"\"1\"\r\n" );
document.write( "\r\n" );
document.write( "Then we find out what would happen if there were some positive integer k,\r\n" );
document.write( "for which it were true.  If it were true for n = k, then we would have:\r\n" );
document.write( "\r\n" );
document.write( "\"1+%2B+2+%2B+2%5E2+%2B+2%5E3+%2B+%22%22%2A%22%22%2A%22%22%2A%22%22+%2B+2%5E%28k-1%29\"\"%22%22=%22%22\"\"2%5Ek+-+1\"\r\n" );
document.write( "\r\n" );
document.write( "If that were true, we would be able to add 2k to both sides and\r\n" );
document.write( "it would still be true.  Then we would have:\r\n" );
document.write( "\r\n" );
document.write( "\"1+%2B+2+%2B+2%5E2+%2B+2%5E3+%2B+%22%22%2A%22%22%2A%22%22%2A%22%22+%2B+2%5E%28k-1%29%2B2%5Ek\"\"%22%22=%22%22\"\"2%5Ek+-+1%2B2%5Ek\"\r\n" );
document.write( "\r\n" );
document.write( "\"1+%2B+2+%2B+2%5E2+%2B+2%5E3+%2B+%22%22%2A%22%22%2A%22%22%2A%22%22+%2B2%5Ek\"\"%22%22=%22%22\"\"2%2A2%5Ek+-+1\"\r\n" );
document.write( "\r\n" );
document.write( "\"1+%2B+2+%2B+2%5E2+%2B+2%5E3+%2B+%22%22%2A%22%22%2A%22%22%2A%22%22+%2B2%5Ek\"\"%22%22=%22%22\"\"2%5E1%2A2%5Ek+-+1\"\r\n" );
document.write( "\r\n" );
document.write( "\"1+%2B+2+%2B+2%5E2+%2B+2%5E3+%2B+%22%22%2A%22%22%2A%22%22%2A%22%22+%2B2%5Ek\"\"%22%22=%22%22\"\"2%5E%28k%2B1%29+-+1\"\r\n" );
document.write( "\r\n" );
document.write( "That is the original expression with k+1 substituted for n.\r\n" );
document.write( "\r\n" );
document.write( "So if we could find a positive integer k so that the equation were true,\r\n" );
document.write( "then we would know that it would have to also be true for the next higher\r\n" );
document.write( "positive integer.\r\n" );
document.write( "\r\n" );
document.write( "Now we DO have a positive integer k=1 so that the equation is true! That's\r\n" );
document.write( "because at the first we showed that it is true when n=k=1, so that means it\r\n" );
document.write( "is true for n=2.  Now, the fact that it's true for n=2 shows that it's also\r\n" );
document.write( "true for n=3, and so on and on, through all the positive integers.\r\n" );
document.write( "\r\n" );
document.write( "Edwin
\n" ); document.write( "
\n" );