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) ![]() You can put this solution on YOUR website! \n" ); document.write( "I assume that an = 2^n-1+1 refers to \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( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "and \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "and \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "and lastly \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \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 \n" ); document.write( "The goal is to show \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "A bit of scratch work off to the side \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Now onto the inductive step \n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \n" ); document.write( " \n" ); document.write( "\n" ); document.write( " \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 \n" ); document.write( " \n" ); document.write( "\n" ); document.write( "Therefore, the recursive sequence \n" ); document.write( " \n" ); document.write( "has the closed form \n" ); document.write( " \n" ); document.write( "A spreadsheet can be used to generate a list of examples. \n" ); document.write( " \n" ); document.write( " |