Proving difference between two functions is small when $x$ is small…Upperbound approximation to the sum of Euler's totient functionAsymptotic expansion for the solution of linear KDV eq.monotonic decrising p normProof of inequality using Taylor series and geometric seriesProduct of two monotonic real functionsMonotonicity of the difference of monotonic composite functionsProve that a sequence is monotonically decreasing/increasingFinding lower bound of summation in inequalityExamine the following sequences of numbers $(a_n)$ with $n in mathbbN$ for the properties of monotonicity and boundedness.Approximating $pi$ with arctangent

Is there a minimum number of transactions in a block?

Why is this code 6.5x slower with optimizations enabled?

Why is an old chain unsafe?

What does "enim et" mean?

Can Medicine checks be used, with decent rolls, to completely mitigate the risk of death from ongoing damage?

How is the claim "I am in New York only if I am in America" the same as "If I am in New York, then I am in America?

What do you call something that goes against the spirit of the law, but is legal when interpreting the law to the letter?

Is Social Media Science Fiction?

How do you conduct xenoanthropology after first contact?

What is the offset in a seaplane's hull?

Why is "Reports" in sentence down without "The"

How is the relation "the smallest element is the same" reflexive?

Simulate Bitwise Cyclic Tag

How old can references or sources in a thesis be?

Why doesn't Newton's third law mean a person bounces back to where they started when they hit the ground?

How to make payment on the internet without leaving a money trail?

Prevent a directory in /tmp from being deleted

Shell script can be run only with sh command

New order #4: World

"which" command doesn't work / path of Safari?

Is it legal to have the "// (c) 2019 John Smith" header in all files when there are hundreds of contributors?

Chess with symmetric move-square

Example of a relative pronoun

When blogging recipes, how can I support both readers who want the narrative/journey and ones who want the printer-friendly recipe?



Proving difference between two functions is small when $x$ is small…


Upperbound approximation to the sum of Euler's totient functionAsymptotic expansion for the solution of linear KDV eq.monotonic decrising p normProof of inequality using Taylor series and geometric seriesProduct of two monotonic real functionsMonotonicity of the difference of monotonic composite functionsProve that a sequence is monotonically decreasing/increasingFinding lower bound of summation in inequalityExamine the following sequences of numbers $(a_n)$ with $n in mathbbN$ for the properties of monotonicity and boundedness.Approximating $pi$ with arctangent













1












$begingroup$


I'm really struggling to prove the following claim and I was wondering whether anyone could help me.




Claim:$$ 0<|x| leq 10^-4 implies bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12$$




My attempt at a proof: I have already proven the following inequality,
$$bigg frace^x-1x - sum_k=1^n fracx^k-1k! bigg leq frac(n+1)!$$
So let $n=3$, then
beginalign*
bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) cdot left( frace^x-1x - sum_k=1^3 fracx^k-1k! right) bigg \
&= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot bigg frace^x-1x - sum_k=1^3 fracx^k-1k! bigg \
&leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot fracx(3+1)! \
&leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac(10^-4)^3 e^10^-44! \
&= 10^-12 cdot bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac e^10^-44!
endalign*
Hence, it suffices to show that for $0 < |x| leq 10^-4$,
beginalign*
f(x) := bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg < frac4!e^10^-4
endalign*

Since $f(x)$ is monotonically decreasing on the intervals $[-10^-4, 0)$ and $(0, 10^-4]$, we know that for $0 <|x| leq 10^-4$,
beginalign*
f(x) leq f left( -10^-4 right) approx 1.0001 < frac4!e^10^-4
endalign*
Therefore, for $0 < |x| leq 10^-4$,
beginalign*
bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12
endalign*
$square$



My big problem here is that I don't actually know how to prove my claim that $f(x)$ is monotonically decreasing. Does anyone know how to prove this?



Or even better, does anyone know of a more direct proof that avoids this problem altogether?



Thanks!










share|cite|improve this question









$endgroup$
















    1












    $begingroup$


    I'm really struggling to prove the following claim and I was wondering whether anyone could help me.




    Claim:$$ 0<|x| leq 10^-4 implies bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12$$




    My attempt at a proof: I have already proven the following inequality,
    $$bigg frace^x-1x - sum_k=1^n fracx^k-1k! bigg leq frac(n+1)!$$
    So let $n=3$, then
    beginalign*
    bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) cdot left( frace^x-1x - sum_k=1^3 fracx^k-1k! right) bigg \
    &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot bigg frace^x-1x - sum_k=1^3 fracx^k-1k! bigg \
    &leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot fracx(3+1)! \
    &leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac(10^-4)^3 e^10^-44! \
    &= 10^-12 cdot bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac e^10^-44!
    endalign*
    Hence, it suffices to show that for $0 < |x| leq 10^-4$,
    beginalign*
    f(x) := bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg < frac4!e^10^-4
    endalign*

    Since $f(x)$ is monotonically decreasing on the intervals $[-10^-4, 0)$ and $(0, 10^-4]$, we know that for $0 <|x| leq 10^-4$,
    beginalign*
    f(x) leq f left( -10^-4 right) approx 1.0001 < frac4!e^10^-4
    endalign*
    Therefore, for $0 < |x| leq 10^-4$,
    beginalign*
    bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12
    endalign*
    $square$



    My big problem here is that I don't actually know how to prove my claim that $f(x)$ is monotonically decreasing. Does anyone know how to prove this?



    Or even better, does anyone know of a more direct proof that avoids this problem altogether?



    Thanks!










    share|cite|improve this question









    $endgroup$














      1












      1








      1





      $begingroup$


      I'm really struggling to prove the following claim and I was wondering whether anyone could help me.




      Claim:$$ 0<|x| leq 10^-4 implies bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12$$




      My attempt at a proof: I have already proven the following inequality,
      $$bigg frace^x-1x - sum_k=1^n fracx^k-1k! bigg leq frac(n+1)!$$
      So let $n=3$, then
      beginalign*
      bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) cdot left( frace^x-1x - sum_k=1^3 fracx^k-1k! right) bigg \
      &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot bigg frace^x-1x - sum_k=1^3 fracx^k-1k! bigg \
      &leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot fracx(3+1)! \
      &leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac(10^-4)^3 e^10^-44! \
      &= 10^-12 cdot bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac e^10^-44!
      endalign*
      Hence, it suffices to show that for $0 < |x| leq 10^-4$,
      beginalign*
      f(x) := bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg < frac4!e^10^-4
      endalign*

      Since $f(x)$ is monotonically decreasing on the intervals $[-10^-4, 0)$ and $(0, 10^-4]$, we know that for $0 <|x| leq 10^-4$,
      beginalign*
      f(x) leq f left( -10^-4 right) approx 1.0001 < frac4!e^10^-4
      endalign*
      Therefore, for $0 < |x| leq 10^-4$,
      beginalign*
      bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12
      endalign*
      $square$



      My big problem here is that I don't actually know how to prove my claim that $f(x)$ is monotonically decreasing. Does anyone know how to prove this?



      Or even better, does anyone know of a more direct proof that avoids this problem altogether?



      Thanks!










      share|cite|improve this question









      $endgroup$




      I'm really struggling to prove the following claim and I was wondering whether anyone could help me.




      Claim:$$ 0<|x| leq 10^-4 implies bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12$$




      My attempt at a proof: I have already proven the following inequality,
      $$bigg frace^x-1x - sum_k=1^n fracx^k-1k! bigg leq frac(n+1)!$$
      So let $n=3$, then
      beginalign*
      bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) cdot left( frace^x-1x - sum_k=1^3 fracx^k-1k! right) bigg \
      &= bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot bigg frace^x-1x - sum_k=1^3 fracx^k-1k! bigg \
      &leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot fracx(3+1)! \
      &leq bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac(10^-4)^3 e^10^-44! \
      &= 10^-12 cdot bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg cdot frac e^10^-44!
      endalign*
      Hence, it suffices to show that for $0 < |x| leq 10^-4$,
      beginalign*
      f(x) := bigg fracx(e^x-1)(sum_k=1^3 fracx^k-1k!) bigg < frac4!e^10^-4
      endalign*

      Since $f(x)$ is monotonically decreasing on the intervals $[-10^-4, 0)$ and $(0, 10^-4]$, we know that for $0 <|x| leq 10^-4$,
      beginalign*
      f(x) leq f left( -10^-4 right) approx 1.0001 < frac4!e^10^-4
      endalign*
      Therefore, for $0 < |x| leq 10^-4$,
      beginalign*
      bigg fracxe^x-1 - frac1sum_k=1^3 fracx^k-1k! bigg leq 10^-12
      endalign*
      $square$



      My big problem here is that I don't actually know how to prove my claim that $f(x)$ is monotonically decreasing. Does anyone know how to prove this?



      Or even better, does anyone know of a more direct proof that avoids this problem altogether?



      Thanks!







      taylor-expansion approximation monotone-functions






      share|cite|improve this question













      share|cite|improve this question











      share|cite|improve this question




      share|cite|improve this question










      asked Mar 29 at 22:19









      jasonjason

      1029




      1029




















          2 Answers
          2






          active

          oldest

          votes


















          0












          $begingroup$

          Write $|fracxe^x-1 - fracxsum_k=1^3 fracx^kk!|
          = |x||fracsum_k=1^3 fracx^kk! - (e^x-1)(e^x-1)sum_k=1^3 fracx^kk!| $



          You can use the $|x|<10^-4$ bound given, and also instead an easier inequality for the numerator using the series sum for $e^x$. Then it is clear that the denominator is obviously increasing in $x$.



          So I guess this comes under "direct proof". I think your function $f(x)$ is probably decreasing though.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
            $endgroup$
            – jason
            Mar 30 at 9:23










          • $begingroup$
            The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
            $endgroup$
            – George Dewhirst
            Mar 30 at 13:50


















          0












          $begingroup$

          For $|x|<epsilon=10^-4$, by the mean value theorem $$left|frace^x-1xright|=e^yge e^-epsilonge1-epsilon,$$ and $$1+fracx2+fracx^26ge1-fracepsilon2,$$ so it follows that $$left|fracxe^x-1frac11+fracx2+fracx^26right|lefrac1(1-epsilon)^2le2lefrac4!e^epsilon$$






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
            $endgroup$
            – jason
            Mar 30 at 9:30










          • $begingroup$
            I thought $0<x$. I'll modify for $x<0$.
            $endgroup$
            – Chrystomath
            Mar 31 at 6:04











          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%2f3167693%2fproving-difference-between-two-functions-is-small-when-x-is-small%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









          0












          $begingroup$

          Write $|fracxe^x-1 - fracxsum_k=1^3 fracx^kk!|
          = |x||fracsum_k=1^3 fracx^kk! - (e^x-1)(e^x-1)sum_k=1^3 fracx^kk!| $



          You can use the $|x|<10^-4$ bound given, and also instead an easier inequality for the numerator using the series sum for $e^x$. Then it is clear that the denominator is obviously increasing in $x$.



          So I guess this comes under "direct proof". I think your function $f(x)$ is probably decreasing though.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
            $endgroup$
            – jason
            Mar 30 at 9:23










          • $begingroup$
            The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
            $endgroup$
            – George Dewhirst
            Mar 30 at 13:50















          0












          $begingroup$

          Write $|fracxe^x-1 - fracxsum_k=1^3 fracx^kk!|
          = |x||fracsum_k=1^3 fracx^kk! - (e^x-1)(e^x-1)sum_k=1^3 fracx^kk!| $



          You can use the $|x|<10^-4$ bound given, and also instead an easier inequality for the numerator using the series sum for $e^x$. Then it is clear that the denominator is obviously increasing in $x$.



          So I guess this comes under "direct proof". I think your function $f(x)$ is probably decreasing though.






          share|cite|improve this answer









          $endgroup$












          • $begingroup$
            Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
            $endgroup$
            – jason
            Mar 30 at 9:23










          • $begingroup$
            The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
            $endgroup$
            – George Dewhirst
            Mar 30 at 13:50













          0












          0








          0





          $begingroup$

          Write $|fracxe^x-1 - fracxsum_k=1^3 fracx^kk!|
          = |x||fracsum_k=1^3 fracx^kk! - (e^x-1)(e^x-1)sum_k=1^3 fracx^kk!| $



          You can use the $|x|<10^-4$ bound given, and also instead an easier inequality for the numerator using the series sum for $e^x$. Then it is clear that the denominator is obviously increasing in $x$.



          So I guess this comes under "direct proof". I think your function $f(x)$ is probably decreasing though.






          share|cite|improve this answer









          $endgroup$



          Write $|fracxe^x-1 - fracxsum_k=1^3 fracx^kk!|
          = |x||fracsum_k=1^3 fracx^kk! - (e^x-1)(e^x-1)sum_k=1^3 fracx^kk!| $



          You can use the $|x|<10^-4$ bound given, and also instead an easier inequality for the numerator using the series sum for $e^x$. Then it is clear that the denominator is obviously increasing in $x$.



          So I guess this comes under "direct proof". I think your function $f(x)$ is probably decreasing though.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Mar 29 at 23:53









          George DewhirstGeorge Dewhirst

          7514




          7514











          • $begingroup$
            Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
            $endgroup$
            – jason
            Mar 30 at 9:23










          • $begingroup$
            The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
            $endgroup$
            – George Dewhirst
            Mar 30 at 13:50
















          • $begingroup$
            Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
            $endgroup$
            – jason
            Mar 30 at 9:23










          • $begingroup$
            The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
            $endgroup$
            – George Dewhirst
            Mar 30 at 13:50















          $begingroup$
          Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
          $endgroup$
          – jason
          Mar 30 at 9:23




          $begingroup$
          Thanks for the response! I'm not quite sure how the denominator is obviously increasing in $x$ nor how this fact if true would help establish an upper bound? Wouldn't we want the denominator to be decreasing in $x$? And I'm not sure exactly what the easier inequality for the numerator you're talking about would be?
          $endgroup$
          – jason
          Mar 30 at 9:23












          $begingroup$
          The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
          $endgroup$
          – George Dewhirst
          Mar 30 at 13:50




          $begingroup$
          The numerator is equal to the sum: $sum_k=4^infty fracx^kk!$ which you could bound. This is using the power series expansion for $e^x$. Denominator is increasing, that's to say that the expression as a whole is decreasing.
          $endgroup$
          – George Dewhirst
          Mar 30 at 13:50











          0












          $begingroup$

          For $|x|<epsilon=10^-4$, by the mean value theorem $$left|frace^x-1xright|=e^yge e^-epsilonge1-epsilon,$$ and $$1+fracx2+fracx^26ge1-fracepsilon2,$$ so it follows that $$left|fracxe^x-1frac11+fracx2+fracx^26right|lefrac1(1-epsilon)^2le2lefrac4!e^epsilon$$






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
            $endgroup$
            – jason
            Mar 30 at 9:30










          • $begingroup$
            I thought $0<x$. I'll modify for $x<0$.
            $endgroup$
            – Chrystomath
            Mar 31 at 6:04















          0












          $begingroup$

          For $|x|<epsilon=10^-4$, by the mean value theorem $$left|frace^x-1xright|=e^yge e^-epsilonge1-epsilon,$$ and $$1+fracx2+fracx^26ge1-fracepsilon2,$$ so it follows that $$left|fracxe^x-1frac11+fracx2+fracx^26right|lefrac1(1-epsilon)^2le2lefrac4!e^epsilon$$






          share|cite|improve this answer











          $endgroup$












          • $begingroup$
            Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
            $endgroup$
            – jason
            Mar 30 at 9:30










          • $begingroup$
            I thought $0<x$. I'll modify for $x<0$.
            $endgroup$
            – Chrystomath
            Mar 31 at 6:04













          0












          0








          0





          $begingroup$

          For $|x|<epsilon=10^-4$, by the mean value theorem $$left|frace^x-1xright|=e^yge e^-epsilonge1-epsilon,$$ and $$1+fracx2+fracx^26ge1-fracepsilon2,$$ so it follows that $$left|fracxe^x-1frac11+fracx2+fracx^26right|lefrac1(1-epsilon)^2le2lefrac4!e^epsilon$$






          share|cite|improve this answer











          $endgroup$



          For $|x|<epsilon=10^-4$, by the mean value theorem $$left|frace^x-1xright|=e^yge e^-epsilonge1-epsilon,$$ and $$1+fracx2+fracx^26ge1-fracepsilon2,$$ so it follows that $$left|fracxe^x-1frac11+fracx2+fracx^26right|lefrac1(1-epsilon)^2le2lefrac4!e^epsilon$$







          share|cite|improve this answer














          share|cite|improve this answer



          share|cite|improve this answer








          edited Mar 31 at 6:26

























          answered Mar 30 at 8:38









          ChrystomathChrystomath

          2,013513




          2,013513











          • $begingroup$
            Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
            $endgroup$
            – jason
            Mar 30 at 9:30










          • $begingroup$
            I thought $0<x$. I'll modify for $x<0$.
            $endgroup$
            – Chrystomath
            Mar 31 at 6:04
















          • $begingroup$
            Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
            $endgroup$
            – jason
            Mar 30 at 9:30










          • $begingroup$
            I thought $0<x$. I'll modify for $x<0$.
            $endgroup$
            – Chrystomath
            Mar 31 at 6:04















          $begingroup$
          Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
          $endgroup$
          – jason
          Mar 30 at 9:30




          $begingroup$
          Hi thanks for getting back to me! This argument is fine for $x geq 0$, but I don't think any similar argument works for $x < 0$...
          $endgroup$
          – jason
          Mar 30 at 9:30












          $begingroup$
          I thought $0<x$. I'll modify for $x<0$.
          $endgroup$
          – Chrystomath
          Mar 31 at 6:04




          $begingroup$
          I thought $0<x$. I'll modify for $x<0$.
          $endgroup$
          – Chrystomath
          Mar 31 at 6:04

















          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%2f3167693%2fproving-difference-between-two-functions-is-small-when-x-is-small%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

          Triangular numbers and gcdProving sum of a set is $0 pmod n$ if $n$ is odd, or $fracn2 pmod n$ if $n$ is even?Is greatest common divisor of two numbers really their smallest linear combination?GCD, LCM RelationshipProve a set of nonnegative integers with greatest common divisor 1 and closed under addition has all but finite many nonnegative integers.all pairs of a and b in an equation containing gcdTriangular Numbers Modulo $k$ - Hit All Values?Understanding the Existence and Uniqueness of the GCDGCD and LCM with logical symbolsThe greatest common divisor of two positive integers less than 100 is equal to 3. Their least common multiple is twelve times one of the integers.Suppose that for all integers $x$, $x|a$ and $x|b$ if and only if $x|c$. Then $c = gcd(a,b)$Which is the gcd of 2 numbers which are multiplied and the result is 600000?

          Ingelân Ynhâld Etymology | Geografy | Skiednis | Polityk en bestjoer | Ekonomy | Demografy | Kultuer | Klimaat | Sjoch ek | Keppelings om utens | Boarnen, noaten en referinsjes Navigaasjemenuwww.gov.ukOffisjele webside fan it regear fan it Feriene KeninkrykOffisjele webside fan it Britske FerkearsburoNederlânsktalige ynformaasje fan it Britske FerkearsburoOffisjele webside fan English Heritage, de organisaasje dy't him ynset foar it behâld fan it Ingelske kultuergoedYnwennertallen fan alle Britske stêden út 'e folkstelling fan 2011Notes en References, op dizze sideEngland

          Հադիս Բովանդակություն Անվանում և նշանակություն | Դասակարգում | Աղբյուրներ | Նավարկման ցանկ