document.write( "Question 1205174: A sequence {𝑎𝑛} is defined by 𝑎1 = 2, 𝑎2 = 3 and 𝑎𝑛+2 = 3𝑎𝑛+1 − 2𝑎𝑛 for all 𝑛 = 1, 2, 3, ….
\n" ); document.write( "Prove by mathematical induction that
\n" ); document.write( "𝑎𝑛 = 2^𝑛−1 + 1 for all 𝑛 = 1, 2, 3, ….
\n" ); document.write( "

Algebra.Com's Answer #841818 by math_tutor2020(3817)\"\" \"About 
You can put this solution on YOUR website!

\n" ); document.write( "I assume that an = 2^n-1+1 refers to \"a%5Bn%5D+=+2%5E%28n-1%29%2B1\"
\n" ); document.write( "To make \"n-1\" the exponent, surround it in parenthesis.
\n" ); document.write( "You should write an = 2^(n-1)+1\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Base case:
\n" ); document.write( "n = 1
\n" ); document.write( "\"a%5Bn%2B2%5D+=+3%2Aa%5Bn%2B1%5D-2%2Aa%5Bn%5D\"
\n" ); document.write( "\"a%5B1%2B2%5D+=+3%2Aa%5B1%2B1%5D-2%2Aa%5B1%5D\"
\n" ); document.write( "\"a%5B3%5D+=+3%2Aa%5B2%5D-2%2Aa%5B1%5D\"
\n" ); document.write( "\"a%5B3%5D+=+3%2A3-2%2A2\"
\n" ); document.write( "\"a%5B3%5D+=+5\"
\n" ); document.write( "and
\n" ); document.write( "\"a%5Bn%5D+=+2%5E%28n-1%29%2B1\"
\n" ); document.write( "\"a%5B1%5D+=+2%5E%281-1%29%2B1\"
\n" ); document.write( "\"a%5B1%5D+=+2\"
\n" ); document.write( "and
\n" ); document.write( "\"a%5Bn%5D+=+2%5E%28n-1%29%2B1\"
\n" ); document.write( "\"a%5B2%5D+=+2%5E%282-1%29%2B1\"
\n" ); document.write( "\"a%5B2%5D+=+3\"
\n" ); document.write( "and lastly
\n" ); document.write( "\"a%5Bn%5D+=+2%5E%28n-1%29%2B1\"
\n" ); document.write( "\"a%5B3%5D+=+2%5E%283-1%29%2B1\"
\n" ); document.write( "\"a%5B3%5D+=+5\"
\n" ); document.write( "The base case is done.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Inductive step:
\n" ); document.write( "Assume that \"a%5Bk%5D+=+2%5E%28k-1%29%2B1\" for some integer k such that k > 3.
\n" ); document.write( "The goal is to show \"a%5Bk%2B1%5D+=+2%5E%28k%2B1-1%29%2B1+=+2%5Ek+%2B+1\" based on that assumption.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "A bit of scratch work off to the side
\n" ); document.write( "\"a%5Bk%5D+=+2%5E%28k-1%29%2B1\"
\n" ); document.write( "\"a%5Bk-1%5D+=+2%5E%28k-1-1%29%2B1\"
\n" ); document.write( "\"a%5Bk-1%5D+=+2%5E%28k-2%29%2B1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Now onto the inductive step
\n" ); document.write( "\"a%5Bn%2B2%5D+=+3%2Aa%5Bn%2B1%5D-2%2Aa%5Bn%5D\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk-1%2B2%5D+=+3%2Aa%5Bk-1%2B1%5D-2%2Aa%5Bk-1%5D\" Reindexing (replace each n with k-1)\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+3%2Aa%5Bk%5D-2%2Aa%5Bk-1%5D\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+3%2A%282%5E%28k-1%29%2B1%29-2%2A%282%5E%28k-2%29%2B1%29\" Substitution. Use the inductive assumption shown above.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+3%2A2%5E%28k-1%29%2B3-2%2A2%5E%28k-2%29-2\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+3%2A2%5E%28k-1%29-2%2A2%5E%28k-2%29%2B1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+3%2A2%5Ek%2A2%5E%28-1%29-2%2A2%5Ek%2A2%5E%28-2%29%2B1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+%283%2F2%29%2A2%5Ek-%281%2F2%29%2A2%5Ek%2B1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+%283%2F2-1%2F2%29%2A2%5Ek%2B1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+%281%29%2A2%5Ek%2B1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "\"a%5Bk%2B1%5D+=+2%5Ek%2B1\"
\n" ); document.write( "This wraps up the inductive step and the induction proof is complete.\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "We have shown that the assumption \"a%5Bk%5D+=+2%5E%28k-1%29%2B1\" leads to \"a%5Bk%2B1%5D+=+2%5Ek+%2B+1\"\r
\n" ); document.write( "
\n" ); document.write( "\n" ); document.write( "Therefore, the recursive sequence
\n" ); document.write( "\"system%28a%5B1%5D+=+2%2C+a%5B2%5D+=+3%2C+a%5Bn%2B2%5D+=+3%2Aa%5Bn%2B1%5D-2%2Aa%5Bn%5D%29\"
\n" ); document.write( "has the closed form
\n" ); document.write( "\"a%5Bn%5D+=+2%5E%28n-1%29%2B1\"
\n" ); document.write( "A spreadsheet can be used to generate a list of examples.
\n" ); document.write( "
\n" ); document.write( "
\n" );