Prove that $sum_n=0^inftyfracx^nn!$ is not uniformly convergent on $(0, +infty)ni x$.prove that the series is not uniformly convergentProve $x^n$ is not uniformly convergentProve that function is not uniformly convergentProve that $f_n(x) = frac1x chi _[frac 1 n, 2]$ is not uniformly convergent on $[0,2]$?Prove $sum_n=0^inftyx^n$ not converge uniformlyProve that $sum_n=1^infty (fracln xx)^n$ converge uniformlyprove that $lim_nto infty a_n=$finiteProve convergence / divergence of $sum_n=2^infty(-1)^nfrac sqrt n(-1)^n+sqrt nsinleft(frac 1sqrt nright)$Prove that $sum_ngeqslant 1 x^n/n$ is not uniformly convergentWhy $ sum_k=1^inftyfrac1k^1+x $ is not uniformly convergent on $ left(0,;+inftyright) $

How did the USSR manage to innovate in an environment characterized by government censorship and high bureaucracy?

What Brexit solution does the DUP want?

Email Account under attack (really) - anything I can do?

What makes Graph invariants so useful/important?

Can I interfere when another PC is about to be attacked?

Banach space and Hilbert space topology

Infinite past with a beginning?

How to calculate implied correlation via observed market price (Margrabe option)

Concept of linear mappings are confusing me

black dwarf stars and dark matter

Set-theoretical foundations of Mathematics with only bounded quantifiers

Shell script can be run only with sh command

Is there a minimum number of transactions in a block?

Modification to Chariots for Heavy Cavalry Analogue for 4-armed race

Why Is Death Allowed In the Matrix?

How is this relation reflexive?

How to type dʒ symbol (IPA) on Mac?

How can bays and straits be determined in a procedurally generated map?

If Manufacturer spice model and Datasheet give different values which should I use?

Why is the design of haulage companies so “special”?

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

XeLaTeX and pdfLaTeX ignore hyphenation

What defenses are there against being summoned by the Gate spell?

Possibly bubble sort algorithm



Prove that $sum_n=0^inftyfracx^nn!$ is not uniformly convergent on $(0, +infty)ni x$.


prove that the series is not uniformly convergentProve $x^n$ is not uniformly convergentProve that function is not uniformly convergentProve that $f_n(x) = frac1x chi _[frac 1 n, 2]$ is not uniformly convergent on $[0,2]$?Prove $sum_n=0^inftyx^n$ not converge uniformlyProve that $sum_n=1^infty (fracln xx)^n$ converge uniformlyprove that $lim_nto infty a_n=$finiteProve convergence / divergence of $sum_n=2^infty(-1)^nfrac sqrt n(-1)^n+sqrt nsinleft(frac 1sqrt nright)$Prove that $sum_ngeqslant 1 x^n/n$ is not uniformly convergentWhy $ sum_k=1^inftyfrac1k^1+x $ is not uniformly convergent on $ left(0,;+inftyright) $













1












$begingroup$



Prove that $sum_n=0^inftyfracx^nn!$ is not uniformly
convergent on $(0, +infty)ni x$.




I wanted to do it by applying Cauchy's test and coming to a contradiction (i.e. $epsilon>$ positive constant):



$$epsilon>|fracx^n+1(n+1)!+fracx^n+2(n+2)!+cdots+fracx^n+p(n+p)!|$$



$$epsilon>|fracx^n+1(n+1)!cdot(1+fracxn+2+cdots+fracx^p-1(n+2)cdots(n+p))|.$$



The expressions within the ||'s reminded me of $e^x=1+x+cdots$, but after several tries I still wasn't able to evaluate. I've also tried standard method of 'find the smallest one in the brackets and take it $p$ times', but that didn't lead anywhere.



Another idea where I took $x$ to be an expression involving $n$ worked, but is it even legal? $x$ is supposed to be fixed, and $n$ is arbitrarily large, so I don't know.



Hints or full answers, I will be very grateful.










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    You could use the fact that a uniformly convergent series is uniformly Cauchy. In particular, its terms must converge uniformly to $0$.
    $endgroup$
    – David Mitra
    Apr 1 at 17:05
















1












$begingroup$



Prove that $sum_n=0^inftyfracx^nn!$ is not uniformly
convergent on $(0, +infty)ni x$.




I wanted to do it by applying Cauchy's test and coming to a contradiction (i.e. $epsilon>$ positive constant):



$$epsilon>|fracx^n+1(n+1)!+fracx^n+2(n+2)!+cdots+fracx^n+p(n+p)!|$$



$$epsilon>|fracx^n+1(n+1)!cdot(1+fracxn+2+cdots+fracx^p-1(n+2)cdots(n+p))|.$$



The expressions within the ||'s reminded me of $e^x=1+x+cdots$, but after several tries I still wasn't able to evaluate. I've also tried standard method of 'find the smallest one in the brackets and take it $p$ times', but that didn't lead anywhere.



Another idea where I took $x$ to be an expression involving $n$ worked, but is it even legal? $x$ is supposed to be fixed, and $n$ is arbitrarily large, so I don't know.



Hints or full answers, I will be very grateful.










share|cite|improve this question









$endgroup$







  • 1




    $begingroup$
    You could use the fact that a uniformly convergent series is uniformly Cauchy. In particular, its terms must converge uniformly to $0$.
    $endgroup$
    – David Mitra
    Apr 1 at 17:05














1












1








1





$begingroup$



Prove that $sum_n=0^inftyfracx^nn!$ is not uniformly
convergent on $(0, +infty)ni x$.




I wanted to do it by applying Cauchy's test and coming to a contradiction (i.e. $epsilon>$ positive constant):



$$epsilon>|fracx^n+1(n+1)!+fracx^n+2(n+2)!+cdots+fracx^n+p(n+p)!|$$



$$epsilon>|fracx^n+1(n+1)!cdot(1+fracxn+2+cdots+fracx^p-1(n+2)cdots(n+p))|.$$



The expressions within the ||'s reminded me of $e^x=1+x+cdots$, but after several tries I still wasn't able to evaluate. I've also tried standard method of 'find the smallest one in the brackets and take it $p$ times', but that didn't lead anywhere.



Another idea where I took $x$ to be an expression involving $n$ worked, but is it even legal? $x$ is supposed to be fixed, and $n$ is arbitrarily large, so I don't know.



Hints or full answers, I will be very grateful.










share|cite|improve this question









$endgroup$





Prove that $sum_n=0^inftyfracx^nn!$ is not uniformly
convergent on $(0, +infty)ni x$.




I wanted to do it by applying Cauchy's test and coming to a contradiction (i.e. $epsilon>$ positive constant):



$$epsilon>|fracx^n+1(n+1)!+fracx^n+2(n+2)!+cdots+fracx^n+p(n+p)!|$$



$$epsilon>|fracx^n+1(n+1)!cdot(1+fracxn+2+cdots+fracx^p-1(n+2)cdots(n+p))|.$$



The expressions within the ||'s reminded me of $e^x=1+x+cdots$, but after several tries I still wasn't able to evaluate. I've also tried standard method of 'find the smallest one in the brackets and take it $p$ times', but that didn't lead anywhere.



Another idea where I took $x$ to be an expression involving $n$ worked, but is it even legal? $x$ is supposed to be fixed, and $n$ is arbitrarily large, so I don't know.



Hints or full answers, I will be very grateful.







sequences-and-series convergence uniform-convergence






share|cite|improve this question













share|cite|improve this question











share|cite|improve this question




share|cite|improve this question










asked Apr 1 at 16:47









fragileradiusfragileradius

306214




306214







  • 1




    $begingroup$
    You could use the fact that a uniformly convergent series is uniformly Cauchy. In particular, its terms must converge uniformly to $0$.
    $endgroup$
    – David Mitra
    Apr 1 at 17:05













  • 1




    $begingroup$
    You could use the fact that a uniformly convergent series is uniformly Cauchy. In particular, its terms must converge uniformly to $0$.
    $endgroup$
    – David Mitra
    Apr 1 at 17:05








1




1




$begingroup$
You could use the fact that a uniformly convergent series is uniformly Cauchy. In particular, its terms must converge uniformly to $0$.
$endgroup$
– David Mitra
Apr 1 at 17:05





$begingroup$
You could use the fact that a uniformly convergent series is uniformly Cauchy. In particular, its terms must converge uniformly to $0$.
$endgroup$
– David Mitra
Apr 1 at 17:05











2 Answers
2






active

oldest

votes


















2












$begingroup$

Note that



$$sup_x in (0,infty)left|sum_k=n+1^infty fracx^kk!right| geqslantsup_x in (1,infty)sum_k=n+1^2n fracx^kk!geqslant sup_x in (1,infty)fracnx^n(2n)! $$



Can you show that the RHS does not converge to $0$ as $n to infty$?






share|cite|improve this answer









$endgroup$












  • $begingroup$
    I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
    $endgroup$
    – fragileradius
    Apr 2 at 21:37






  • 1




    $begingroup$
    Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
    $endgroup$
    – RRL
    Apr 2 at 21:50



















1












$begingroup$

Much easier if we can use that the sum is the exponential: the partial sum is a polynomial and the exponential grows faster than any polinomial, so for any $n$
$$sup_xin(0,infty)left|e^x - sum_k=0^nfracx^kk!right| = infty$$






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%2f3170836%2fprove-that-sum-n-0-infty-fracxnn-is-not-uniformly-convergent-on%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









    2












    $begingroup$

    Note that



    $$sup_x in (0,infty)left|sum_k=n+1^infty fracx^kk!right| geqslantsup_x in (1,infty)sum_k=n+1^2n fracx^kk!geqslant sup_x in (1,infty)fracnx^n(2n)! $$



    Can you show that the RHS does not converge to $0$ as $n to infty$?






    share|cite|improve this answer









    $endgroup$












    • $begingroup$
      I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
      $endgroup$
      – fragileradius
      Apr 2 at 21:37






    • 1




      $begingroup$
      Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
      $endgroup$
      – RRL
      Apr 2 at 21:50
















    2












    $begingroup$

    Note that



    $$sup_x in (0,infty)left|sum_k=n+1^infty fracx^kk!right| geqslantsup_x in (1,infty)sum_k=n+1^2n fracx^kk!geqslant sup_x in (1,infty)fracnx^n(2n)! $$



    Can you show that the RHS does not converge to $0$ as $n to infty$?






    share|cite|improve this answer









    $endgroup$












    • $begingroup$
      I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
      $endgroup$
      – fragileradius
      Apr 2 at 21:37






    • 1




      $begingroup$
      Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
      $endgroup$
      – RRL
      Apr 2 at 21:50














    2












    2








    2





    $begingroup$

    Note that



    $$sup_x in (0,infty)left|sum_k=n+1^infty fracx^kk!right| geqslantsup_x in (1,infty)sum_k=n+1^2n fracx^kk!geqslant sup_x in (1,infty)fracnx^n(2n)! $$



    Can you show that the RHS does not converge to $0$ as $n to infty$?






    share|cite|improve this answer









    $endgroup$



    Note that



    $$sup_x in (0,infty)left|sum_k=n+1^infty fracx^kk!right| geqslantsup_x in (1,infty)sum_k=n+1^2n fracx^kk!geqslant sup_x in (1,infty)fracnx^n(2n)! $$



    Can you show that the RHS does not converge to $0$ as $n to infty$?







    share|cite|improve this answer












    share|cite|improve this answer



    share|cite|improve this answer










    answered Apr 1 at 19:57









    RRLRRL

    53.4k52574




    53.4k52574











    • $begingroup$
      I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
      $endgroup$
      – fragileradius
      Apr 2 at 21:37






    • 1




      $begingroup$
      Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
      $endgroup$
      – RRL
      Apr 2 at 21:50

















    • $begingroup$
      I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
      $endgroup$
      – fragileradius
      Apr 2 at 21:37






    • 1




      $begingroup$
      Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
      $endgroup$
      – RRL
      Apr 2 at 21:50
















    $begingroup$
    I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
    $endgroup$
    – fragileradius
    Apr 2 at 21:37




    $begingroup$
    I am sorry, but I'm having trouble seeing how RHS does not converge to zero. Am I supposed to take $x=n$? Thank you.
    $endgroup$
    – fragileradius
    Apr 2 at 21:37




    1




    1




    $begingroup$
    Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
    $endgroup$
    – RRL
    Apr 2 at 21:50





    $begingroup$
    Well either see that the RHS is greater than $fracnx_n^n(2n)! $ for any sequence $x_n$ and take any $x_n^n$ growing faster than $(2n)!$ -- like $x_n = (2n)!$ -- or simply notice that the supremum is $+infty$.
    $endgroup$
    – RRL
    Apr 2 at 21:50












    1












    $begingroup$

    Much easier if we can use that the sum is the exponential: the partial sum is a polynomial and the exponential grows faster than any polinomial, so for any $n$
    $$sup_xin(0,infty)left|e^x - sum_k=0^nfracx^kk!right| = infty$$






    share|cite|improve this answer









    $endgroup$

















      1












      $begingroup$

      Much easier if we can use that the sum is the exponential: the partial sum is a polynomial and the exponential grows faster than any polinomial, so for any $n$
      $$sup_xin(0,infty)left|e^x - sum_k=0^nfracx^kk!right| = infty$$






      share|cite|improve this answer









      $endgroup$















        1












        1








        1





        $begingroup$

        Much easier if we can use that the sum is the exponential: the partial sum is a polynomial and the exponential grows faster than any polinomial, so for any $n$
        $$sup_xin(0,infty)left|e^x - sum_k=0^nfracx^kk!right| = infty$$






        share|cite|improve this answer









        $endgroup$



        Much easier if we can use that the sum is the exponential: the partial sum is a polynomial and the exponential grows faster than any polinomial, so for any $n$
        $$sup_xin(0,infty)left|e^x - sum_k=0^nfracx^kk!right| = infty$$







        share|cite|improve this answer












        share|cite|improve this answer



        share|cite|improve this answer










        answered Apr 2 at 16:36









        Martín-Blas Pérez PinillaMartín-Blas Pérez Pinilla

        35.4k42972




        35.4k42972



























            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%2f3170836%2fprove-that-sum-n-0-infty-fracxnn-is-not-uniformly-convergent-on%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

            Bosc Connection Yimello Approaching Angry The produce zaps the market. 구성 기록되다 변경...

            WordPress Information needed

            Hidroelektrana Sadržaj Povijest | Podjela hidroelektrana | Snaga dobivena u hidroelektranama | Dijelovi hidroelektrane | Uloga hidroelektrana u suvremenom svijetu | Prednosti hidroelektrana | Nedostaci hidroelektrana | Države s najvećom proizvodnjom hidro-električne energije | Deset najvećih hidroelektrana u svijetu | Hidroelektrane u Hrvatskoj | Izvori | Poveznice | Vanjske poveznice | Navigacijski izbornikTechnical Report, Version 2Zajedničkom poslužiteljuHidroelektranaHEP Proizvodnja d.o.o. - Hidroelektrane u Hrvatskoj