Proof of $2^n > n$ by Induction












3












$begingroup$


I'm new to induction and trying to prove $2^n > n$ for all natural numbers.



I've seen a couple of examples but am confused about the the case going from $k = 1$ to $k =2$.



So I show $2^1 > 1$ as the base case.



Then I assume $2^k > k$



Meaning that



$2.2^k > 2k$



i.e.



$2^{k+1} > 2k$



Or



$2^{k+1} > k + k > k + 1$



So it is considered proven.



But when $k = 1$, $k + k not> k + 1$



What am I missing please?



Do I need a special case for going from $k=1$ to $k=2$?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Adding a special case when $k=1$ is a perfectly valid solution. Saying $k+kgeq k+1$ for $kgeq1$ is probably nicer though.
    $endgroup$
    – SmileyCraft
    Dec 12 '18 at 9:45


















3












$begingroup$


I'm new to induction and trying to prove $2^n > n$ for all natural numbers.



I've seen a couple of examples but am confused about the the case going from $k = 1$ to $k =2$.



So I show $2^1 > 1$ as the base case.



Then I assume $2^k > k$



Meaning that



$2.2^k > 2k$



i.e.



$2^{k+1} > 2k$



Or



$2^{k+1} > k + k > k + 1$



So it is considered proven.



But when $k = 1$, $k + k not> k + 1$



What am I missing please?



Do I need a special case for going from $k=1$ to $k=2$?










share|cite|improve this question









$endgroup$








  • 1




    $begingroup$
    Adding a special case when $k=1$ is a perfectly valid solution. Saying $k+kgeq k+1$ for $kgeq1$ is probably nicer though.
    $endgroup$
    – SmileyCraft
    Dec 12 '18 at 9:45
















3












3








3


0



$begingroup$


I'm new to induction and trying to prove $2^n > n$ for all natural numbers.



I've seen a couple of examples but am confused about the the case going from $k = 1$ to $k =2$.



So I show $2^1 > 1$ as the base case.



Then I assume $2^k > k$



Meaning that



$2.2^k > 2k$



i.e.



$2^{k+1} > 2k$



Or



$2^{k+1} > k + k > k + 1$



So it is considered proven.



But when $k = 1$, $k + k not> k + 1$



What am I missing please?



Do I need a special case for going from $k=1$ to $k=2$?










share|cite|improve this question









$endgroup$




I'm new to induction and trying to prove $2^n > n$ for all natural numbers.



I've seen a couple of examples but am confused about the the case going from $k = 1$ to $k =2$.



So I show $2^1 > 1$ as the base case.



Then I assume $2^k > k$



Meaning that



$2.2^k > 2k$



i.e.



$2^{k+1} > 2k$



Or



$2^{k+1} > k + k > k + 1$



So it is considered proven.



But when $k = 1$, $k + k not> k + 1$



What am I missing please?



Do I need a special case for going from $k=1$ to $k=2$?







inequality induction






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Dec 12 '18 at 9:42









RobinRobin

1577




1577








  • 1




    $begingroup$
    Adding a special case when $k=1$ is a perfectly valid solution. Saying $k+kgeq k+1$ for $kgeq1$ is probably nicer though.
    $endgroup$
    – SmileyCraft
    Dec 12 '18 at 9:45
















  • 1




    $begingroup$
    Adding a special case when $k=1$ is a perfectly valid solution. Saying $k+kgeq k+1$ for $kgeq1$ is probably nicer though.
    $endgroup$
    – SmileyCraft
    Dec 12 '18 at 9:45










1




1




$begingroup$
Adding a special case when $k=1$ is a perfectly valid solution. Saying $k+kgeq k+1$ for $kgeq1$ is probably nicer though.
$endgroup$
– SmileyCraft
Dec 12 '18 at 9:45






$begingroup$
Adding a special case when $k=1$ is a perfectly valid solution. Saying $k+kgeq k+1$ for $kgeq1$ is probably nicer though.
$endgroup$
– SmileyCraft
Dec 12 '18 at 9:45












2 Answers
2






active

oldest

votes


















4












$begingroup$

Technically, the statement $$2^{k+1} > k+k>k+1$$ is wrong, precisely because $k$ could be $1$. You can, however, write
$$2^{k+1} > k+k geq k+1$$



and from that, you can still conclude that $2^{k+1}>k+1$. No special case needed, since $a>b$ and $bgeq c$ always implies $a>c$.






share|cite|improve this answer









$endgroup$





















    4












    $begingroup$

    No, you don't need a special case. $2^{k+1} >2k $ and $2k geq k+1$ together impliy $2^{k+1} >k+1 $






    share|cite|improve this answer









    $endgroup$














      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%2f3036471%2fproof-of-2n-n-by-induction%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      2 Answers
      2






      active

      oldest

      votes








      2 Answers
      2






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      4












      $begingroup$

      Technically, the statement $$2^{k+1} > k+k>k+1$$ is wrong, precisely because $k$ could be $1$. You can, however, write
      $$2^{k+1} > k+k geq k+1$$



      and from that, you can still conclude that $2^{k+1}>k+1$. No special case needed, since $a>b$ and $bgeq c$ always implies $a>c$.






      share|cite|improve this answer









      $endgroup$


















        4












        $begingroup$

        Technically, the statement $$2^{k+1} > k+k>k+1$$ is wrong, precisely because $k$ could be $1$. You can, however, write
        $$2^{k+1} > k+k geq k+1$$



        and from that, you can still conclude that $2^{k+1}>k+1$. No special case needed, since $a>b$ and $bgeq c$ always implies $a>c$.






        share|cite|improve this answer









        $endgroup$
















          4












          4








          4





          $begingroup$

          Technically, the statement $$2^{k+1} > k+k>k+1$$ is wrong, precisely because $k$ could be $1$. You can, however, write
          $$2^{k+1} > k+k geq k+1$$



          and from that, you can still conclude that $2^{k+1}>k+1$. No special case needed, since $a>b$ and $bgeq c$ always implies $a>c$.






          share|cite|improve this answer









          $endgroup$



          Technically, the statement $$2^{k+1} > k+k>k+1$$ is wrong, precisely because $k$ could be $1$. You can, however, write
          $$2^{k+1} > k+k geq k+1$$



          and from that, you can still conclude that $2^{k+1}>k+1$. No special case needed, since $a>b$ and $bgeq c$ always implies $a>c$.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Dec 12 '18 at 9:45









          5xum5xum

          91.8k394161




          91.8k394161























              4












              $begingroup$

              No, you don't need a special case. $2^{k+1} >2k $ and $2k geq k+1$ together impliy $2^{k+1} >k+1 $






              share|cite|improve this answer









              $endgroup$


















                4












                $begingroup$

                No, you don't need a special case. $2^{k+1} >2k $ and $2k geq k+1$ together impliy $2^{k+1} >k+1 $






                share|cite|improve this answer









                $endgroup$
















                  4












                  4








                  4





                  $begingroup$

                  No, you don't need a special case. $2^{k+1} >2k $ and $2k geq k+1$ together impliy $2^{k+1} >k+1 $






                  share|cite|improve this answer









                  $endgroup$



                  No, you don't need a special case. $2^{k+1} >2k $ and $2k geq k+1$ together impliy $2^{k+1} >k+1 $







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Dec 12 '18 at 9:45









                  Kavi Rama MurthyKavi Rama Murthy

                  71.7k53170




                  71.7k53170






























                      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%2f3036471%2fproof-of-2n-n-by-induction%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

                      Biblatex bibliography style without URLs when DOI exists (in Overleaf with Zotero bibliography)

                      ComboBox Display Member on multiple fields

                      Is it possible to collect Nectar points via Trainline?