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

          161k22127232




          161k22127232












          • $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

          How to change which sound is reproduced for terminal bell?

          Image
          3 Recently upgrade to 18.10 from 18.04, and using the terminal is becoming annoying: the new alert sound is a drip ( /usr/share/sounds/gnome/default/alerts/drip.ogg ), and the previous one is still located at ( /usr/share/sounds/ubuntu/stereo/bell.ogg ). My issue is that at the gnome-terminal, when autocompleting or pressing left BOTH sounds are reproduced, at the same time. I want to just have ubuntu/stereo/bell.ogg active, not both . At the moment I have been only able to reduce the volume of the alerts (but still both are played), or turn the alerts down (but I dislike both "solutions"). gnome-terminal 18.10 teminal-bell share | improve this question ...
          Read more

          Can I use Tabulator js library in my java Spring + Thymeleaf project?

          Image
          0 I want to add Tabulator js to my java project. I added tabulator.min.js, tabulator.min.css to resources folder. After that added to my html page these dependencies as recommending in readme.md. <link rel="stylesheet" th:href="@{/css/tabulator.min.css}"> <script type="text/javascript" th:src="@{/js/tabulator.min.js}"></script> Now my tables view all elements, that I have in the html page, but not correct. In the documentation of Tabulator is example how to create header and table, var table = new Tabulator("#example-table", { columns:[ {title:"Name", field:"name", sorter:"string", width:200, editor:true}, {title:"Age", field:"age", sorter:"...
          Read more

          Title Spacing in Bjornstrup Chapter, Removing Chapter Number From Contents

          Image
          up vote 5 down vote favorite 2 I would like to make it so that the vertical space below the title of each chapter is the same when using the Bjornstrup package (i.e. so that the descenders do not affect the spacing - as shown by the red arrow in the picture below). I think I'm fairly happy with the spacing around "A chapter", so I'd really like titles without descenders (e.g. "Contents") to have the same vertical spacing as "A chapter" below the title. I would also like to remove the large "0" in the contents title. Any help appreciated, as always. documentclass[11pt,a4paper]{book} % Packages[![enter image description here][1]][1] usepackage[left=3.5cm, right=3.5cm, top=4.3cm, bottom=4.25cm]{geometry} usepackage[utf8]{inputenc} usepackage{libertine} usepackage[libertine]{newtx...
          Read more