Proof by mathematical induction with the problem $40(2n)! ≥ 30^n$












1












$begingroup$


I want to start by saying that I have for less trouble handling a non-inequality induction problem. I really don't understand the steps to take to get to the desired end product with these inequality induction proofs. That being said, I feel like I just wrote a mess on my paper that leads me nowhere. Here's my proof so far for the mathematical induction of $40(2n)!≥30^{n}$, where n ≥ 1



Let P(n) be the statement $40(2n)!≥30^{n}$ where n ≥ 1.



Basis Step: (n = 1) $LHS = 40 * 2! = 80$ and $RHS = 30^{1} = 30$



$80 ≥ 30$



Inductive Step: Assume $P(k)$ is true for $k = 1$. Our goal is to show $P(k+1)$ is true by showing $40(2(k+1))!≥30^{k+1}$ for $k ≥ 1$.



(Beyond this step I have no clue how to alter the LHS factorial or the RHS exponent in such a way to benefit me. Below is my work so far)



LHS: (I tried to multiply $(2k+2)(2k+1)$ to both sides, but then I didn't see how that would help)$40(2k)!≥30^{k} = (2k)!*40≥30^{k} = (2k+2)(2k+1)(2k)!*40≥30^{k}*(2k+2)(2k+1)$



RHS: $40(2(k+1))!≥30^{k+1}=(2k+2)!*40≥30^{k+1}=(2k+2)(2k+1)(2k)!*40≥30^{k+1}$ $=(2k+2)(2k+1)(2k)!*40≥30*30^{k}$



(I then assumed the inductive hypothesis and placed $40(2k)!≥30^{k}$ in the middle to get...)



$(2k+2)(2k+1)(2k)!*40≥40(2k)!≥30^{k}≥30*30^{k}$



At this point, I've got nothing. I know that $30^{k}≥30*30^{k}$ makes no sense, but I don't know where to move $30*30^{k}$ since I can't assume that $40(2k)!≥30*30^{k}$. I don't have any clue how I can manipulate either side to help me.






inequality induction







share|cite|improve this question











$endgroup$












  • $begingroup$
    For induction proofs involving an inequality, the restriction on the values of $n$ is almost always going to form part of the proof (see the answer below).
    $endgroup$
    – 1123581321
    10 mins ago


















1












$begingroup$


I want to start by saying that I have for less trouble handling a non-inequality induction problem. I really don't understand the steps to take to get to the desired end product with these inequality induction proofs. That being said, I feel like I just wrote a mess on my paper that leads me nowhere. Here's my proof so far for the mathematical induction of $40(2n)!≥30^{n}$, where n ≥ 1



Let P(n) be the statement $40(2n)!≥30^{n}$ where n ≥ 1.



Basis Step: (n = 1) $LHS = 40 * 2! = 80$ and $RHS = 30^{1} = 30$



$80 ≥ 30$



Inductive Step: Assume $P(k)$ is true for $k = 1$. Our goal is to show $P(k+1)$ is true by showing $40(2(k+1))!≥30^{k+1}$ for $k ≥ 1$.



(Beyond this step I have no clue how to alter the LHS factorial or the RHS exponent in such a way to benefit me. Below is my work so far)



LHS: (I tried to multiply $(2k+2)(2k+1)$ to both sides, but then I didn't see how that would help)$40(2k)!≥30^{k} = (2k)!*40≥30^{k} = (2k+2)(2k+1)(2k)!*40≥30^{k}*(2k+2)(2k+1)$



RHS: $40(2(k+1))!≥30^{k+1}=(2k+2)!*40≥30^{k+1}=(2k+2)(2k+1)(2k)!*40≥30^{k+1}$ $=(2k+2)(2k+1)(2k)!*40≥30*30^{k}$



(I then assumed the inductive hypothesis and placed $40(2k)!≥30^{k}$ in the middle to get...)



$(2k+2)(2k+1)(2k)!*40≥40(2k)!≥30^{k}≥30*30^{k}$



At this point, I've got nothing. I know that $30^{k}≥30*30^{k}$ makes no sense, but I don't know where to move $30*30^{k}$ since I can't assume that $40(2k)!≥30*30^{k}$. I don't have any clue how I can manipulate either side to help me.






inequality induction







share|cite|improve this question











$endgroup$












  • $begingroup$
    For induction proofs involving an inequality, the restriction on the values of $n$ is almost always going to form part of the proof (see the answer below).
    $endgroup$
    – 1123581321
    10 mins ago
















1












1








1





$begingroup$


I want to start by saying that I have for less trouble handling a non-inequality induction problem. I really don't understand the steps to take to get to the desired end product with these inequality induction proofs. That being said, I feel like I just wrote a mess on my paper that leads me nowhere. Here's my proof so far for the mathematical induction of $40(2n)!≥30^{n}$, where n ≥ 1



Let P(n) be the statement $40(2n)!≥30^{n}$ where n ≥ 1.



Basis Step: (n = 1) $LHS = 40 * 2! = 80$ and $RHS = 30^{1} = 30$



$80 ≥ 30$



Inductive Step: Assume $P(k)$ is true for $k = 1$. Our goal is to show $P(k+1)$ is true by showing $40(2(k+1))!≥30^{k+1}$ for $k ≥ 1$.



(Beyond this step I have no clue how to alter the LHS factorial or the RHS exponent in such a way to benefit me. Below is my work so far)



LHS: (I tried to multiply $(2k+2)(2k+1)$ to both sides, but then I didn't see how that would help)$40(2k)!≥30^{k} = (2k)!*40≥30^{k} = (2k+2)(2k+1)(2k)!*40≥30^{k}*(2k+2)(2k+1)$



RHS: $40(2(k+1))!≥30^{k+1}=(2k+2)!*40≥30^{k+1}=(2k+2)(2k+1)(2k)!*40≥30^{k+1}$ $=(2k+2)(2k+1)(2k)!*40≥30*30^{k}$



(I then assumed the inductive hypothesis and placed $40(2k)!≥30^{k}$ in the middle to get...)



$(2k+2)(2k+1)(2k)!*40≥40(2k)!≥30^{k}≥30*30^{k}$



At this point, I've got nothing. I know that $30^{k}≥30*30^{k}$ makes no sense, but I don't know where to move $30*30^{k}$ since I can't assume that $40(2k)!≥30*30^{k}$. I don't have any clue how I can manipulate either side to help me.






inequality induction







share|cite|improve this question











$endgroup$




I want to start by saying that I have for less trouble handling a non-inequality induction problem. I really don't understand the steps to take to get to the desired end product with these inequality induction proofs. That being said, I feel like I just wrote a mess on my paper that leads me nowhere. Here's my proof so far for the mathematical induction of $40(2n)!≥30^{n}$, where n ≥ 1



Let P(n) be the statement $40(2n)!≥30^{n}$ where n ≥ 1.



Basis Step: (n = 1) $LHS = 40 * 2! = 80$ and $RHS = 30^{1} = 30$



$80 ≥ 30$



Inductive Step: Assume $P(k)$ is true for $k = 1$. Our goal is to show $P(k+1)$ is true by showing $40(2(k+1))!≥30^{k+1}$ for $k ≥ 1$.



(Beyond this step I have no clue how to alter the LHS factorial or the RHS exponent in such a way to benefit me. Below is my work so far)



LHS: (I tried to multiply $(2k+2)(2k+1)$ to both sides, but then I didn't see how that would help)$40(2k)!≥30^{k} = (2k)!*40≥30^{k} = (2k+2)(2k+1)(2k)!*40≥30^{k}*(2k+2)(2k+1)$



RHS: $40(2(k+1))!≥30^{k+1}=(2k+2)!*40≥30^{k+1}=(2k+2)(2k+1)(2k)!*40≥30^{k+1}$ $=(2k+2)(2k+1)(2k)!*40≥30*30^{k}$



(I then assumed the inductive hypothesis and placed $40(2k)!≥30^{k}$ in the middle to get...)



$(2k+2)(2k+1)(2k)!*40≥40(2k)!≥30^{k}≥30*30^{k}$



At this point, I've got nothing. I know that $30^{k}≥30*30^{k}$ makes no sense, but I don't know where to move $30*30^{k}$ since I can't assume that $40(2k)!≥30*30^{k}$. I don't have any clue how I can manipulate either side to help me.






inequality induction




inequality induction






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 11 mins ago









YuiTo Cheng

2,58641037




2,58641037










asked 2 hours ago









Nick SabiaNick Sabia

566




566












  • $begingroup$
    For induction proofs involving an inequality, the restriction on the values of $n$ is almost always going to form part of the proof (see the answer below).
    $endgroup$
    – 1123581321
    10 mins ago




















  • $begingroup$
    For induction proofs involving an inequality, the restriction on the values of $n$ is almost always going to form part of the proof (see the answer below).
    $endgroup$
    – 1123581321
    10 mins ago


















$begingroup$
For induction proofs involving an inequality, the restriction on the values of $n$ is almost always going to form part of the proof (see the answer below).
$endgroup$
– 1123581321
10 mins ago






$begingroup$
For induction proofs involving an inequality, the restriction on the values of $n$ is almost always going to form part of the proof (see the answer below).
$endgroup$
– 1123581321
10 mins ago












1 Answer
1






active

oldest

votes


















4












$begingroup$

For $k ge 2$, $(2k+1)(2k+2) ge 30$. Hence if $P(k)$ is true for $k=1$ and $k=2$,



$$P(k+1) = 40(2k+2)! = 40(2k)! (2k+1)(2k+2)$$
$$ge 30^k (2k+1)(2k+2)quadquadquad (since 40(2k)! >= 30^k by P(k))$$
$$ ge 30^k cdot 30 forall k ge 2$$
$$ ge 30^{k+1}$$



So you need to verify the proposition for $k=2$ and proceed with the induction.






share|cite|improve this answer









$endgroup$














    Your Answer








    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%2f3195436%2fproof-by-mathematical-induction-with-the-problem-402n-%25e2%2589%25a5-30n%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









    4












    $begingroup$

    For $k ge 2$, $(2k+1)(2k+2) ge 30$. Hence if $P(k)$ is true for $k=1$ and $k=2$,



    $$P(k+1) = 40(2k+2)! = 40(2k)! (2k+1)(2k+2)$$
    $$ge 30^k (2k+1)(2k+2)quadquadquad (since 40(2k)! >= 30^k by P(k))$$
    $$ ge 30^k cdot 30 forall k ge 2$$
    $$ ge 30^{k+1}$$



    So you need to verify the proposition for $k=2$ and proceed with the induction.






    share|cite|improve this answer









    $endgroup$


















      4












      $begingroup$

      For $k ge 2$, $(2k+1)(2k+2) ge 30$. Hence if $P(k)$ is true for $k=1$ and $k=2$,



      $$P(k+1) = 40(2k+2)! = 40(2k)! (2k+1)(2k+2)$$
      $$ge 30^k (2k+1)(2k+2)quadquadquad (since 40(2k)! >= 30^k by P(k))$$
      $$ ge 30^k cdot 30 forall k ge 2$$
      $$ ge 30^{k+1}$$



      So you need to verify the proposition for $k=2$ and proceed with the induction.






      share|cite|improve this answer









      $endgroup$
















        4












        4








        4





        $begingroup$

        For $k ge 2$, $(2k+1)(2k+2) ge 30$. Hence if $P(k)$ is true for $k=1$ and $k=2$,



        $$P(k+1) = 40(2k+2)! = 40(2k)! (2k+1)(2k+2)$$
        $$ge 30^k (2k+1)(2k+2)quadquadquad (since 40(2k)! >= 30^k by P(k))$$
        $$ ge 30^k cdot 30 forall k ge 2$$
        $$ ge 30^{k+1}$$



        So you need to verify the proposition for $k=2$ and proceed with the induction.






        share|cite|improve this answer









        $endgroup$



        For $k ge 2$, $(2k+1)(2k+2) ge 30$. Hence if $P(k)$ is true for $k=1$ and $k=2$,



        $$P(k+1) = 40(2k+2)! = 40(2k)! (2k+1)(2k+2)$$
        $$ge 30^k (2k+1)(2k+2)quadquadquad (since 40(2k)! >= 30^k by P(k))$$
        $$ ge 30^k cdot 30 forall k ge 2$$
        $$ ge 30^{k+1}$$



        So you need to verify the proposition for $k=2$ and proceed with the induction.







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered 1 hour ago









        user1952500user1952500

        1,133812




        1,133812






























            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%2f3195436%2fproof-by-mathematical-induction-with-the-problem-402n-%25e2%2589%25a5-30n%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