Use complete induction to prove that $a_n < 2^n$ for every integer $n geq 2$












2












$begingroup$


Define the sequence of integers $a_0, a_1, a_2, cdots$ as follows



$$ a_i =
begin{cases}
i+1 & 0 leq i leq 2 \
a_{i-1} + a_{i-2} + 2a_{i-3} & i > 2 \
end{cases}
$$



Use complete induction to prove that $a_n < 2^n$ for every integer $n geq 2$



I will prove $a_n < 2^n, forall n geq 2$ by using complete induction



Base Case: Three cases $n = 2, 3, 4$



let $n = 2$



$a_{n} = a_{2} = 2 + 1 = 3 < 4 = 2^2 = 2^n$ By definition, and holds



let $n = 3$



$a_{n} = a_{3} = 3 + 2 + 1 = 6 < 8 = 2^3 = 2^n$ By definition, and holds



let $n = 4$



$a_{n} = a_{4} = 4 + 3 + 2 = 9 < 16 = 2^4 = 2^n$ By definition, and holds



Inductive step: let $n > 4$. Suppose $a_j < 2^j$ whenever $2 leq j < n$. [Inductive hypothesis]



What to prove: $a_n < 2^n$



$a_{n} = a_{i-1} + a_{i-2} + 2a_{i-3}$ [By definition]



$< 2^{n-1} + 2^{n-2} + 2^{n-3+1}$ [By Inductive hypothesis]



$= 2^{n-1} + 2^{n-2} + 2^{n-2}$



$= 2^{n-1} + 2^{n-2 + 1}$



$= 2^{n-1 + 1}$



$= 2^n$



as wanted.



Would this be correct?






induction







share|cite|improve this question











$endgroup$

















    2












    $begingroup$


    Define the sequence of integers $a_0, a_1, a_2, cdots$ as follows



    $$ a_i =
    begin{cases}
    i+1 & 0 leq i leq 2 \
    a_{i-1} + a_{i-2} + 2a_{i-3} & i > 2 \
    end{cases}
    $$



    Use complete induction to prove that $a_n < 2^n$ for every integer $n geq 2$



    I will prove $a_n < 2^n, forall n geq 2$ by using complete induction



    Base Case: Three cases $n = 2, 3, 4$



    let $n = 2$



    $a_{n} = a_{2} = 2 + 1 = 3 < 4 = 2^2 = 2^n$ By definition, and holds



    let $n = 3$



    $a_{n} = a_{3} = 3 + 2 + 1 = 6 < 8 = 2^3 = 2^n$ By definition, and holds



    let $n = 4$



    $a_{n} = a_{4} = 4 + 3 + 2 = 9 < 16 = 2^4 = 2^n$ By definition, and holds



    Inductive step: let $n > 4$. Suppose $a_j < 2^j$ whenever $2 leq j < n$. [Inductive hypothesis]



    What to prove: $a_n < 2^n$



    $a_{n} = a_{i-1} + a_{i-2} + 2a_{i-3}$ [By definition]



    $< 2^{n-1} + 2^{n-2} + 2^{n-3+1}$ [By Inductive hypothesis]



    $= 2^{n-1} + 2^{n-2} + 2^{n-2}$



    $= 2^{n-1} + 2^{n-2 + 1}$



    $= 2^{n-1 + 1}$



    $= 2^n$



    as wanted.



    Would this be correct?






    induction







    share|cite|improve this question











    $endgroup$















      2












      2








      2


      1



      $begingroup$


      Define the sequence of integers $a_0, a_1, a_2, cdots$ as follows



      $$ a_i =
      begin{cases}
      i+1 & 0 leq i leq 2 \
      a_{i-1} + a_{i-2} + 2a_{i-3} & i > 2 \
      end{cases}
      $$



      Use complete induction to prove that $a_n < 2^n$ for every integer $n geq 2$



      I will prove $a_n < 2^n, forall n geq 2$ by using complete induction



      Base Case: Three cases $n = 2, 3, 4$



      let $n = 2$



      $a_{n} = a_{2} = 2 + 1 = 3 < 4 = 2^2 = 2^n$ By definition, and holds



      let $n = 3$



      $a_{n} = a_{3} = 3 + 2 + 1 = 6 < 8 = 2^3 = 2^n$ By definition, and holds



      let $n = 4$



      $a_{n} = a_{4} = 4 + 3 + 2 = 9 < 16 = 2^4 = 2^n$ By definition, and holds



      Inductive step: let $n > 4$. Suppose $a_j < 2^j$ whenever $2 leq j < n$. [Inductive hypothesis]



      What to prove: $a_n < 2^n$



      $a_{n} = a_{i-1} + a_{i-2} + 2a_{i-3}$ [By definition]



      $< 2^{n-1} + 2^{n-2} + 2^{n-3+1}$ [By Inductive hypothesis]



      $= 2^{n-1} + 2^{n-2} + 2^{n-2}$



      $= 2^{n-1} + 2^{n-2 + 1}$



      $= 2^{n-1 + 1}$



      $= 2^n$



      as wanted.



      Would this be correct?






      induction







      share|cite|improve this question











      $endgroup$




      Define the sequence of integers $a_0, a_1, a_2, cdots$ as follows



      $$ a_i =
      begin{cases}
      i+1 & 0 leq i leq 2 \
      a_{i-1} + a_{i-2} + 2a_{i-3} & i > 2 \
      end{cases}
      $$



      Use complete induction to prove that $a_n < 2^n$ for every integer $n geq 2$



      I will prove $a_n < 2^n, forall n geq 2$ by using complete induction



      Base Case: Three cases $n = 2, 3, 4$



      let $n = 2$



      $a_{n} = a_{2} = 2 + 1 = 3 < 4 = 2^2 = 2^n$ By definition, and holds



      let $n = 3$



      $a_{n} = a_{3} = 3 + 2 + 1 = 6 < 8 = 2^3 = 2^n$ By definition, and holds



      let $n = 4$



      $a_{n} = a_{4} = 4 + 3 + 2 = 9 < 16 = 2^4 = 2^n$ By definition, and holds



      Inductive step: let $n > 4$. Suppose $a_j < 2^j$ whenever $2 leq j < n$. [Inductive hypothesis]



      What to prove: $a_n < 2^n$



      $a_{n} = a_{i-1} + a_{i-2} + 2a_{i-3}$ [By definition]



      $< 2^{n-1} + 2^{n-2} + 2^{n-3+1}$ [By Inductive hypothesis]



      $= 2^{n-1} + 2^{n-2} + 2^{n-2}$



      $= 2^{n-1} + 2^{n-2 + 1}$



      $= 2^{n-1 + 1}$



      $= 2^n$



      as wanted.



      Would this be correct?






      induction




      induction






      share|cite|improve this question















      share|cite|improve this question













      share|cite|improve this question




      share|cite|improve this question








      edited Dec 1 '18 at 8:45







      Tree Garen

















      asked Dec 1 '18 at 7:53









      Tree GarenTree Garen

      36219




      36219






















          1 Answer
          1






          active

          oldest

          votes


















          0












          $begingroup$

          The second part is fine. But the base case is not just the $n=2$ case. You should have checked it for $n=0$, and $n=1$ too.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            But it doesn't hold for $n = 0$ or $n = 1$?
            $endgroup$
            – Tree Garen
            Dec 1 '18 at 8:01












          • $begingroup$
            You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:06












          • $begingroup$
            I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
            $endgroup$
            – Tinler
            Dec 1 '18 at 8:14












          • $begingroup$
            Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:26











          Your Answer





          StackExchange.ifUsing("editor", function () {
          return StackExchange.using("mathjaxEditing", function () {
          StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
          StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
          });
          });
          }, "mathjax-editing");

          StackExchange.ready(function() {
          var channelOptions = {
          tags: "".split(" "),
          id: "69"
          };
          initTagRenderer("".split(" "), "".split(" "), channelOptions);

          StackExchange.using("externalEditor", function() {
          // Have to fire editor after snippets, if snippets enabled
          if (StackExchange.settings.snippets.snippetsEnabled) {
          StackExchange.using("snippets", function() {
          createEditor();
          });
          }
          else {
          createEditor();
          }
          });

          function createEditor() {
          StackExchange.prepareEditor({
          heartbeatType: 'answer',
          autoActivateHeartbeat: false,
          convertImagesToLinks: true,
          noModals: true,
          showLowRepImageUploadWarning: true,
          reputationToPostImages: 10,
          bindNavPrevention: true,
          postfix: "",
          imageUploader: {
          brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
          contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
          allowUrls: true
          },
          noCode: true, onDemand: true,
          discardSelector: ".discard-answer"
          ,immediatelyShowMarkdownHelp:true
          });


          }
          });














          draft saved

          draft discarded


















          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3021103%2fuse-complete-induction-to-prove-that-a-n-2n-for-every-integer-n-geq-2%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown

























          1 Answer
          1






          active

          oldest

          votes








          1 Answer
          1






          active

          oldest

          votes









          active

          oldest

          votes






          active

          oldest

          votes









          0












          $begingroup$

          The second part is fine. But the base case is not just the $n=2$ case. You should have checked it for $n=0$, and $n=1$ too.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            But it doesn't hold for $n = 0$ or $n = 1$?
            $endgroup$
            – Tree Garen
            Dec 1 '18 at 8:01












          • $begingroup$
            You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:06












          • $begingroup$
            I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
            $endgroup$
            – Tinler
            Dec 1 '18 at 8:14












          • $begingroup$
            Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:26
















          0












          $begingroup$

          The second part is fine. But the base case is not just the $n=2$ case. You should have checked it for $n=0$, and $n=1$ too.






          share|cite|improve this answer









          $endgroup$













          • $begingroup$
            But it doesn't hold for $n = 0$ or $n = 1$?
            $endgroup$
            – Tree Garen
            Dec 1 '18 at 8:01












          • $begingroup$
            You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:06












          • $begingroup$
            I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
            $endgroup$
            – Tinler
            Dec 1 '18 at 8:14












          • $begingroup$
            Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:26














          0












          0








          0





          $begingroup$

          The second part is fine. But the base case is not just the $n=2$ case. You should have checked it for $n=0$, and $n=1$ too.






          share|cite|improve this answer









          $endgroup$



          The second part is fine. But the base case is not just the $n=2$ case. You should have checked it for $n=0$, and $n=1$ too.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 1 '18 at 7:59









          José Carlos SantosJosé Carlos Santos

          154k22123226




          154k22123226












          • $begingroup$
            But it doesn't hold for $n = 0$ or $n = 1$?
            $endgroup$
            – Tree Garen
            Dec 1 '18 at 8:01












          • $begingroup$
            You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:06












          • $begingroup$
            I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
            $endgroup$
            – Tinler
            Dec 1 '18 at 8:14












          • $begingroup$
            Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:26


















          • $begingroup$
            But it doesn't hold for $n = 0$ or $n = 1$?
            $endgroup$
            – Tree Garen
            Dec 1 '18 at 8:01












          • $begingroup$
            You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:06












          • $begingroup$
            I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
            $endgroup$
            – Tinler
            Dec 1 '18 at 8:14












          • $begingroup$
            Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
            $endgroup$
            – José Carlos Santos
            Dec 1 '18 at 8:26
















          $begingroup$
          But it doesn't hold for $n = 0$ or $n = 1$?
          $endgroup$
          – Tree Garen
          Dec 1 '18 at 8:01






          $begingroup$
          But it doesn't hold for $n = 0$ or $n = 1$?
          $endgroup$
          – Tree Garen
          Dec 1 '18 at 8:01














          $begingroup$
          You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
          $endgroup$
          – José Carlos Santos
          Dec 1 '18 at 8:06






          $begingroup$
          You are right. My mistake. But the you should have checked it for $nin{2,3,4}$. Because only then will your inductive proof shows that it works for $n=5$.
          $endgroup$
          – José Carlos Santos
          Dec 1 '18 at 8:06














          $begingroup$
          I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
          $endgroup$
          – Tinler
          Dec 1 '18 at 8:14






          $begingroup$
          I'm confused why. Why three numbers? And I thought the base case for recurrence functions was just so we can use "$a_{i-1} + a_{i-2} + 2a_{i-3}$" part but that part holds for all $i > 2$ so wouldn't going all the way to $n = 5$ be redundant?
          $endgroup$
          – Tinler
          Dec 1 '18 at 8:14














          $begingroup$
          Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
          $endgroup$
          – José Carlos Santos
          Dec 1 '18 at 8:26




          $begingroup$
          Three numbers because each $a_i$ is defined from the three previous terms. So, in order to prove it it holds for $a_5$, you must know that it holds for $a_2$, $a_3$, and $a_4$.
          $endgroup$
          – José Carlos Santos
          Dec 1 '18 at 8:26


















          draft saved

          draft discarded




















































          Thanks for contributing an answer to Mathematics Stack Exchange!


          • Please be sure to answer the question. Provide details and share your research!

          But avoid …



          • Asking for help, clarification, or responding to other answers.

          • Making statements based on opinion; back them up with references or personal experience.


          Use MathJax to format equations. MathJax reference.


          To learn more, see our tips on writing great answers.




          draft saved


          draft discarded














          StackExchange.ready(
          function () {
          StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fmath.stackexchange.com%2fquestions%2f3021103%2fuse-complete-induction-to-prove-that-a-n-2n-for-every-integer-n-geq-2%23new-answer', 'question_page');
          }
          );

          Post as a guest















          Required, but never shown





















































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown

































          Required, but never shown














          Required, but never shown












          Required, but never shown







          Required, but never shown







          -

          Popular posts from this blog

          Bundesstraße 106

          Image
          Dieser Artikel beschreibt die Bundesstraße 106 in Deutschland. Zur gleichnamigen Straße in Österreich siehe Mölltal Straße. Vorlage:Infobox hochrangige Straße/Wartung/DE-B Bundesstraße 106 in Deutschland Karte Basisdaten Betreiber: Deutschland  Bundesrepublik Deutschland Straßenbeginn: Wismar ( 53° 54′  N , 11° 24′  O 53.900536 11.396875 ) Straßenende: Schwerin ( 53° 36′  N , 11° 24′  O 53.592785 11.404892 ) Gesamtlänge: 40,7 km Bundesland: Mecklenburg-Vorpommern Ausbauzustand: zweistreifig [1] Bundesstraße 106 in Schwerin (Umgehungsstraße) Straßenverlauf Land Mecklenburg-Vorpommern Landkreis Nordwestmecklenburg Ortsumgehung Wismar Wallensteingraben über   Dorf Mecklenburg Wallensteingraben Groß Stieten Bad Kleinen OT Niendorf Bahnstrecke Lübeck–Bad Kleinen Zickhusen Lübstorf Klein Trebbow OT Kirch Stück
          Read more

          Verónica Boquete

          Image
          Verónica Boquete im Trikot der Nationalmannschaft (2013) Personalia Name Verónica Boquete Giadans Geburtstag 9. April 1987 Geburtsort Santiago de Compostela, Spanien Größe 159 cm Position Mittelfeld / Sturm Juniorinnen Jahre Station 2001–2005 Xuventú Aguiño Frauen Jahre Station Spiele (Tore) 1 2005–2008 Prainsa Zaragoza 83 (40) 2008–2010 Espanyol Barcelona 53 (30) 2010 Buffalo Flash 9 0 (9) 2010 Chicago Red Stars 3 0 (1) 2010–2011 Espanyol Barcelona 26 (41) 2011 Philadelphia Independence 13 0 (5) 2011 Energija Woronesch 5 0 (1) 2012–2014 Tyresö FF 39 (14) 2014 Portland Thorns FC 15 0 (4) 2014–2015 1. FFC Frankfurt 23 0 (7) 2015–2016 FC Bayern München 9 0 (0) 2016–2018 Paris Saint-Germain 31 0 (8) 2018 Peking BG Phoenix 2019– Utah Royals FC 0 0 (0) Nationalmannschaft Jahre Auswahl
          Read more

          Ida-Boy-Ed-Garten

          Image
          Die Lage des Ida-Boy-Ed-Gartens, rot markiert Der Ida-Boy-Ed-Garten Der Ida-Boy-Ed-Garten, Blick von der Wakenitzmauer durch das Tor in der Stadtmauer Der Ida-Boy-Ed-Garten ist eine Straße der Lübecker Altstadt. Inhaltsverzeichnis 1 Lage 2 Geschichte 3 Literatur 4 Weblinks Lage | Der etwa 90 Meter lange Ida-Boy-Ed-Garten befindet sich an der nördlichen Spitze der Altstadtinsel, vor dem Burgtor. Die in einem Bogen durch eine Grünanlage hangaufwärts führende Straße verbindet die Wakenitzmauer mit der Burgtorbrücke. Geschichte | Der heutige Ida-Boy-Ed-Garten wurde ursprünglich als Verlängerung der Wakenitzmauer angelegt. 1903 wurde in den erhaltenen Teil der mittelalterlichen Stadtmauer, an dem die Wakenitzmauer bei der Einmündung der Kaiserstraße begann, ein Tor mit einem großen Bogen für die Durchführung der Straße und zwei kleineren seitlichen Öffnungen für Fußgänger gebrochen, um für die neu errichteten Wohnhäuser in diesem Bereich
          Read more