Proof by mathematical induction with the problem $40(2n)! ≥ 30^n$ Announcing the arrival of Valued Associate #679: Cesar Manara Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Proof by Induction (concerning $3^nge1+2n$)Mathematical Induction with InequalitiesProve by using Mathematical induction (sum of the first $n$ odd numbers is $n^2$)Stuck in Induction Inequality: $2^n>3n^2$prove inequality by induction — Discrete mathProve by induction $n! > n^2$Use mathematical induction to prove the following $n! < n^n$Mathematical induction by inequalityStuck On A Proof By InductionProve by induction, for all positive integers $n$, that $n!ge2^n-1$

Special flights

How can I prevent/balance waiting and turtling as a response to cooldown mechanics

Why is the change of basis formula counter-intuitive? [See details]

How many time has Arya actually used Needle?

Why is std::move not [[nodiscard]] in C++20?

How does light 'choose' between wave and particle behaviour?

Should a wizard buy fine inks every time he want to copy spells into his spellbook?

Co-worker has annoying ringtone

Caught masturbating at work

If Windows 7 doesn't support WSL, then what is "Subsystem for UNIX-based Applications"?

Why datecode is SO IMPORTANT to chip manufacturers?

A term for a woman complaining about things/begging in a cute/childish way

What is the "studentd" process?

What is the difference between a "ranged attack" and a "ranged weapon attack"?

i2c bus hangs in master RPi access to MSP430G uC ~1 in 1000 accesses

Found this skink in my tomato plant bucket. Is he trapped? Or could he leave if he wanted?

How can god fight other gods?

What does the writing on Poe's helmet say?

Constant factor of an array

Tannaka duality for semisimple groups

Relating to the President and obstruction, were Mueller's conclusions preordained?

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

Monty Hall Problem-Probability Paradox

How many morphisms from 1 to 1+1 can there be?



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



Announcing the arrival of Valued Associate #679: Cesar Manara
Planned maintenance scheduled April 23, 2019 at 23:30 UTC (7:30pm US/Eastern)Proof by Induction (concerning $3^nge1+2n$)Mathematical Induction with InequalitiesProve by using Mathematical induction (sum of the first $n$ odd numbers is $n^2$)Stuck in Induction Inequality: $2^n>3n^2$prove inequality by induction — Discrete mathProve by induction $n! > n^2$Use mathematical induction to prove the following $n! < n^n$Mathematical induction by inequalityStuck On A Proof By InductionProve by induction, for all positive integers $n$, that $n!ge2^n-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.










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
    8 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.










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
    8 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.










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






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited 9 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
    8 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
    8 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
8 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
8 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

            Möglingen Índice Localización Historia Demografía Referencias Enlaces externos Menú de navegación48°53′18″N 9°07′45″E / 48.888333333333, 9.129166666666748°53′18″N 9°07′45″E / 48.888333333333, 9.1291666666667Sitio web oficial Mapa de Möglingen«Gemeinden in Deutschland nach Fläche, Bevölkerung und Postleitzahl am 30.09.2016»Möglingen

            Virtualbox - Configuration error: Querying “UUID” failed (VERR_CFGM_VALUE_NOT_FOUND)“VERR_SUPLIB_WORLD_WRITABLE” error when trying to installing OS in virtualboxVirtual Box Kernel errorFailed to open a seesion for the virtual machineFailed to open a session for the virtual machineUbuntu 14.04 LTS Virtualbox errorcan't use VM VirtualBoxusing virtualboxI can't run Linux-64 Bit on VirtualBoxUnable to insert the virtual optical disk (VBoxguestaddition) in virtual machine for ubuntu server in win 10VirtuaBox in Ubuntu 18.04 Issues with Win10.ISO Installation

            Torre de la Isleta Índice Véase también Referencias Bibliografía Enlaces externos Menú de navegación38°25′58″N 0°23′02″O / 38.43277778, -0.3838888938°25′58″N 0°23′02″O / 38.43277778, -0.38388889Torre de la Illeta de l’Horta o Torre Saleta. Base de datos de bienes inmuebles. Patrimonio Cultural. Secretaría de Estado de CulturaFicha BIC Torre de la Illeta de l’Horta. Dirección General de Patrimonio Cultural. Generalitat ValencianaLugares de interés. Ayuntamiento del CampelloTorre de la Isleta en CastillosNet.org