What is the asymptotic order of ${2n choose 0}sqrt{n}+ {2n choose 1}sqrt{n-1} +…+{2n choose n}sqrt{0}$?












3












$begingroup$


Binomial expansion gives ${2n choose 0}cdot2+ {2n choose 1}cdot 2 +...+{2n choose n-1}cdot2+{2n choose n}=2^{2n}$. My question is to find the asymptotic order of $$F(n):={2n choose 0}sqrt{n}+ {2n choose 1}sqrt{n-1} +...+{2n choose n}sqrt{0}$$
as $nrightarrow infty$. In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Thanks Barry. I was sloppy on my binomial expansion formula, and it has been corrected.
    $endgroup$
    – Phil.K
    May 14 '18 at 18:53
















3












$begingroup$


Binomial expansion gives ${2n choose 0}cdot2+ {2n choose 1}cdot 2 +...+{2n choose n-1}cdot2+{2n choose n}=2^{2n}$. My question is to find the asymptotic order of $$F(n):={2n choose 0}sqrt{n}+ {2n choose 1}sqrt{n-1} +...+{2n choose n}sqrt{0}$$
as $nrightarrow infty$. In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?










share|cite|improve this question











$endgroup$












  • $begingroup$
    Thanks Barry. I was sloppy on my binomial expansion formula, and it has been corrected.
    $endgroup$
    – Phil.K
    May 14 '18 at 18:53














3












3








3


1



$begingroup$


Binomial expansion gives ${2n choose 0}cdot2+ {2n choose 1}cdot 2 +...+{2n choose n-1}cdot2+{2n choose n}=2^{2n}$. My question is to find the asymptotic order of $$F(n):={2n choose 0}sqrt{n}+ {2n choose 1}sqrt{n-1} +...+{2n choose n}sqrt{0}$$
as $nrightarrow infty$. In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?










share|cite|improve this question











$endgroup$




Binomial expansion gives ${2n choose 0}cdot2+ {2n choose 1}cdot 2 +...+{2n choose n-1}cdot2+{2n choose n}=2^{2n}$. My question is to find the asymptotic order of $$F(n):={2n choose 0}sqrt{n}+ {2n choose 1}sqrt{n-1} +...+{2n choose n}sqrt{0}$$
as $nrightarrow infty$. In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?







combinatorics asymptotics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited May 14 '18 at 18:50







Phil.K

















asked May 14 '18 at 18:26









Phil.KPhil.K

235




235












  • $begingroup$
    Thanks Barry. I was sloppy on my binomial expansion formula, and it has been corrected.
    $endgroup$
    – Phil.K
    May 14 '18 at 18:53


















  • $begingroup$
    Thanks Barry. I was sloppy on my binomial expansion formula, and it has been corrected.
    $endgroup$
    – Phil.K
    May 14 '18 at 18:53
















$begingroup$
Thanks Barry. I was sloppy on my binomial expansion formula, and it has been corrected.
$endgroup$
– Phil.K
May 14 '18 at 18:53




$begingroup$
Thanks Barry. I was sloppy on my binomial expansion formula, and it has been corrected.
$endgroup$
– Phil.K
May 14 '18 at 18:53










3 Answers
3






active

oldest

votes


















2












$begingroup$


In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?




No.



Let's parameterise the sum slightly non-intuitively (it's in the reverse order to the way you've written it): $$sum_{i=0}^n binom{2n}{n-i} sqrt i$$



Then by Stirling's approximation the $i$th term is approximately $$frac{1}{sqrt {2pi}} frac{(2n)^{2n+1/2}}{(n-i)^{n-i+1/2}(n+i)^{n+i+1/2}} sqrt i$$ and when $i = o(n)$ that in turn approximates to $$frac{2^{2n}}{sqrtpi} sqrtfrac{i}{n}$$



Since there are $sqrt{n}$ values of $i$ in the range $[frac12sqrt n, frac32sqrt n)$ you should not expect an upper bound which is asymptotically better than $$2^{2n} n^{1/4}$$



This may not be tight, but it's enough to answer the direct question.






share|cite|improve this answer









$endgroup$













  • $begingroup$
    The $n^{1/4}$ should be in the denominator?
    $endgroup$
    – sku
    May 15 '18 at 22:35










  • $begingroup$
    @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
    $endgroup$
    – Peter Taylor
    May 15 '18 at 22:41








  • 2




    $begingroup$
    Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
    $endgroup$
    – adfriedman
    May 16 '18 at 22:46












  • $begingroup$
    @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
    $endgroup$
    – Peter Taylor
    May 17 '18 at 6:16






  • 1




    $begingroup$
    On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
    $endgroup$
    – Peter Taylor
    May 17 '18 at 7:47



















2












$begingroup$

Here is a first-term asymptotic analysis that gets the same result as Peter Taylor above, but with an explicit constant. Numerically, about 3 digits agreement are obtained for n ~ 1000.



$$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}sum_{k=0}^nexp{(-k^2/n)}sqrt{k}=binom{2n}{n}n^{3/2},frac{1}{n}sum_{k=0}^nexp{(-nbig(frac{k}{n}big)^2)}sqrt{frac{k}{n}}.$$



In the 1st step the well-known expansion for the central binomial coefficients have been used and the 2nd I'm setting up for the interpretation of the sum as a Riemann integral as n $to infty$, i.e.,



$$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}n^{3/2},
int_0^1exp{(-n,x^2)}sqrt{x},dx .$$
The standard asymptotic trick of increasing the upper integral limit go to $infty$ allows us to explicitly calculate the integral with the gamma function. Using the Stirling approximation for the binomial and collecting results the answer so obtained is



$$ sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim frac{Gamma(3/4)}{2sqrt{pi}}
n^{1/4}2^{2n}$$






share|cite|improve this answer









$endgroup$





















    1












    $begingroup$

    Too long for a comment.



    Having fun playing with small numbers, I computed the values of



    $$S_n=sum_{i=0}^n binom{2n}{n-i} sqrt i$$ for $100 leq n leq 10000$ (step size $= 100$). For $n=1000$, the value is almost $1.375times 10^{6021}$ (!!).



    Performing a linear regression
    $$log(S_n)=a+ b n + c log(n)$$
    $$begin{array}{clclclclc}
    text{} & text{Estimate} & text{Standard Error} & text{Confidence Interval} \
    a & -1.08076 & 0.00069 & {-1.08213,-1.07939} \
    b & +1.38629 & approx 0 & {+1.38629,+1.38629} \
    c & +0.25239 & 0.00010 & {+0.25219,+0.25259} \
    end{array}$$ while using skbmoore's answer, the coefficients would be $ {-1.06223,1.38629,0.25000}$.






    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%2f2781195%2fwhat-is-the-asymptotic-order-of-2n-choose-0-sqrtn-2n-choose-1-sqrtn-1%23new-answer', 'question_page');
      }
      );

      Post as a guest















      Required, but never shown

























      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      2












      $begingroup$


      In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?




      No.



      Let's parameterise the sum slightly non-intuitively (it's in the reverse order to the way you've written it): $$sum_{i=0}^n binom{2n}{n-i} sqrt i$$



      Then by Stirling's approximation the $i$th term is approximately $$frac{1}{sqrt {2pi}} frac{(2n)^{2n+1/2}}{(n-i)^{n-i+1/2}(n+i)^{n+i+1/2}} sqrt i$$ and when $i = o(n)$ that in turn approximates to $$frac{2^{2n}}{sqrtpi} sqrtfrac{i}{n}$$



      Since there are $sqrt{n}$ values of $i$ in the range $[frac12sqrt n, frac32sqrt n)$ you should not expect an upper bound which is asymptotically better than $$2^{2n} n^{1/4}$$



      This may not be tight, but it's enough to answer the direct question.






      share|cite|improve this answer









      $endgroup$













      • $begingroup$
        The $n^{1/4}$ should be in the denominator?
        $endgroup$
        – sku
        May 15 '18 at 22:35










      • $begingroup$
        @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
        $endgroup$
        – Peter Taylor
        May 15 '18 at 22:41








      • 2




        $begingroup$
        Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
        $endgroup$
        – adfriedman
        May 16 '18 at 22:46












      • $begingroup$
        @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 6:16






      • 1




        $begingroup$
        On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 7:47
















      2












      $begingroup$


      In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?




      No.



      Let's parameterise the sum slightly non-intuitively (it's in the reverse order to the way you've written it): $$sum_{i=0}^n binom{2n}{n-i} sqrt i$$



      Then by Stirling's approximation the $i$th term is approximately $$frac{1}{sqrt {2pi}} frac{(2n)^{2n+1/2}}{(n-i)^{n-i+1/2}(n+i)^{n+i+1/2}} sqrt i$$ and when $i = o(n)$ that in turn approximates to $$frac{2^{2n}}{sqrtpi} sqrtfrac{i}{n}$$



      Since there are $sqrt{n}$ values of $i$ in the range $[frac12sqrt n, frac32sqrt n)$ you should not expect an upper bound which is asymptotically better than $$2^{2n} n^{1/4}$$



      This may not be tight, but it's enough to answer the direct question.






      share|cite|improve this answer









      $endgroup$













      • $begingroup$
        The $n^{1/4}$ should be in the denominator?
        $endgroup$
        – sku
        May 15 '18 at 22:35










      • $begingroup$
        @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
        $endgroup$
        – Peter Taylor
        May 15 '18 at 22:41








      • 2




        $begingroup$
        Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
        $endgroup$
        – adfriedman
        May 16 '18 at 22:46












      • $begingroup$
        @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 6:16






      • 1




        $begingroup$
        On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 7:47














      2












      2








      2





      $begingroup$


      In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?




      No.



      Let's parameterise the sum slightly non-intuitively (it's in the reverse order to the way you've written it): $$sum_{i=0}^n binom{2n}{n-i} sqrt i$$



      Then by Stirling's approximation the $i$th term is approximately $$frac{1}{sqrt {2pi}} frac{(2n)^{2n+1/2}}{(n-i)^{n-i+1/2}(n+i)^{n+i+1/2}} sqrt i$$ and when $i = o(n)$ that in turn approximates to $$frac{2^{2n}}{sqrtpi} sqrtfrac{i}{n}$$



      Since there are $sqrt{n}$ values of $i$ in the range $[frac12sqrt n, frac32sqrt n)$ you should not expect an upper bound which is asymptotically better than $$2^{2n} n^{1/4}$$



      This may not be tight, but it's enough to answer the direct question.






      share|cite|improve this answer









      $endgroup$




      In particular, is it true that for all $n$, $F(n)le Ccdot 2^{2n}$ for some constant $C$?




      No.



      Let's parameterise the sum slightly non-intuitively (it's in the reverse order to the way you've written it): $$sum_{i=0}^n binom{2n}{n-i} sqrt i$$



      Then by Stirling's approximation the $i$th term is approximately $$frac{1}{sqrt {2pi}} frac{(2n)^{2n+1/2}}{(n-i)^{n-i+1/2}(n+i)^{n+i+1/2}} sqrt i$$ and when $i = o(n)$ that in turn approximates to $$frac{2^{2n}}{sqrtpi} sqrtfrac{i}{n}$$



      Since there are $sqrt{n}$ values of $i$ in the range $[frac12sqrt n, frac32sqrt n)$ you should not expect an upper bound which is asymptotically better than $$2^{2n} n^{1/4}$$



      This may not be tight, but it's enough to answer the direct question.







      share|cite|improve this answer












      share|cite|improve this answer



      share|cite|improve this answer










      answered May 15 '18 at 16:12









      Peter TaylorPeter Taylor

      8,80312341




      8,80312341












      • $begingroup$
        The $n^{1/4}$ should be in the denominator?
        $endgroup$
        – sku
        May 15 '18 at 22:35










      • $begingroup$
        @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
        $endgroup$
        – Peter Taylor
        May 15 '18 at 22:41








      • 2




        $begingroup$
        Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
        $endgroup$
        – adfriedman
        May 16 '18 at 22:46












      • $begingroup$
        @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 6:16






      • 1




        $begingroup$
        On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 7:47


















      • $begingroup$
        The $n^{1/4}$ should be in the denominator?
        $endgroup$
        – sku
        May 15 '18 at 22:35










      • $begingroup$
        @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
        $endgroup$
        – Peter Taylor
        May 15 '18 at 22:41








      • 2




        $begingroup$
        Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
        $endgroup$
        – adfriedman
        May 16 '18 at 22:46












      • $begingroup$
        @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 6:16






      • 1




        $begingroup$
        On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
        $endgroup$
        – Peter Taylor
        May 17 '18 at 7:47
















      $begingroup$
      The $n^{1/4}$ should be in the denominator?
      $endgroup$
      – sku
      May 15 '18 at 22:35




      $begingroup$
      The $n^{1/4}$ should be in the denominator?
      $endgroup$
      – sku
      May 15 '18 at 22:35












      $begingroup$
      @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
      $endgroup$
      – Peter Taylor
      May 15 '18 at 22:41






      $begingroup$
      @sku, no, the argument is that there are (at least) $n^{1/2}$ terms which are $Omega(2^{2n} n^{-1/4})$, and adding them gives a sum which is $Omega(2^{2n} n^{1/4})$.
      $endgroup$
      – Peter Taylor
      May 15 '18 at 22:41






      2




      2




      $begingroup$
      Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
      $endgroup$
      – adfriedman
      May 16 '18 at 22:46






      $begingroup$
      Also Cauchy-Schwartz gives $O(2^{2n}n^{3/ 4})$: begin{align} F(n) &= sum_{k=0}^n binom{2n}{k}sqrt{n-k}\ &leq left(sum_{i=0}^n binom{2n}{k}^2 right)^{1/ 2}left(sum_{j=0}^n (n-j)right)^{1/ 2}\ &= left(frac12 binom{2n}{n}^2 + frac12binom{4n}{2n} right)^{1/ 2}left(frac{n(n+1)}{2}right)^{1/ 2}\ &sim frac{1}{2} left( left(frac{2^{2n}}{sqrt{pi n}}right)^2 + frac{2^{2(2n)}}{sqrt{pi (2n)}} right)^{1/ 2} n\ &sim frac{1}{2sqrt{2pi}} 2^{2n} n^{3/ 4} end{align}
      $endgroup$
      – adfriedman
      May 16 '18 at 22:46














      $begingroup$
      @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
      $endgroup$
      – Peter Taylor
      May 17 '18 at 6:16




      $begingroup$
      @adfriedman, I understand the argument from the penultimate line to the last one to be that the second term inside the sqrt dominates, but then the constant seems incorrect by a factor of $(2pi)^{1/4}$. That aside, I think you should post an answer rather than a comment.
      $endgroup$
      – Peter Taylor
      May 17 '18 at 6:16




      1




      1




      $begingroup$
      On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
      $endgroup$
      – Peter Taylor
      May 17 '18 at 7:47




      $begingroup$
      On further reflection, I understand why you posted it as a comment: it's an upper bound, but the answer to the question consists of a lower bound. So we have $Omega(2^{2n} n^{1/4})$ and $O(2^{2n} n^{3/4})$.
      $endgroup$
      – Peter Taylor
      May 17 '18 at 7:47











      2












      $begingroup$

      Here is a first-term asymptotic analysis that gets the same result as Peter Taylor above, but with an explicit constant. Numerically, about 3 digits agreement are obtained for n ~ 1000.



      $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}sum_{k=0}^nexp{(-k^2/n)}sqrt{k}=binom{2n}{n}n^{3/2},frac{1}{n}sum_{k=0}^nexp{(-nbig(frac{k}{n}big)^2)}sqrt{frac{k}{n}}.$$



      In the 1st step the well-known expansion for the central binomial coefficients have been used and the 2nd I'm setting up for the interpretation of the sum as a Riemann integral as n $to infty$, i.e.,



      $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}n^{3/2},
      int_0^1exp{(-n,x^2)}sqrt{x},dx .$$
      The standard asymptotic trick of increasing the upper integral limit go to $infty$ allows us to explicitly calculate the integral with the gamma function. Using the Stirling approximation for the binomial and collecting results the answer so obtained is



      $$ sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim frac{Gamma(3/4)}{2sqrt{pi}}
      n^{1/4}2^{2n}$$






      share|cite|improve this answer









      $endgroup$


















        2












        $begingroup$

        Here is a first-term asymptotic analysis that gets the same result as Peter Taylor above, but with an explicit constant. Numerically, about 3 digits agreement are obtained for n ~ 1000.



        $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}sum_{k=0}^nexp{(-k^2/n)}sqrt{k}=binom{2n}{n}n^{3/2},frac{1}{n}sum_{k=0}^nexp{(-nbig(frac{k}{n}big)^2)}sqrt{frac{k}{n}}.$$



        In the 1st step the well-known expansion for the central binomial coefficients have been used and the 2nd I'm setting up for the interpretation of the sum as a Riemann integral as n $to infty$, i.e.,



        $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}n^{3/2},
        int_0^1exp{(-n,x^2)}sqrt{x},dx .$$
        The standard asymptotic trick of increasing the upper integral limit go to $infty$ allows us to explicitly calculate the integral with the gamma function. Using the Stirling approximation for the binomial and collecting results the answer so obtained is



        $$ sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim frac{Gamma(3/4)}{2sqrt{pi}}
        n^{1/4}2^{2n}$$






        share|cite|improve this answer









        $endgroup$
















          2












          2








          2





          $begingroup$

          Here is a first-term asymptotic analysis that gets the same result as Peter Taylor above, but with an explicit constant. Numerically, about 3 digits agreement are obtained for n ~ 1000.



          $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}sum_{k=0}^nexp{(-k^2/n)}sqrt{k}=binom{2n}{n}n^{3/2},frac{1}{n}sum_{k=0}^nexp{(-nbig(frac{k}{n}big)^2)}sqrt{frac{k}{n}}.$$



          In the 1st step the well-known expansion for the central binomial coefficients have been used and the 2nd I'm setting up for the interpretation of the sum as a Riemann integral as n $to infty$, i.e.,



          $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}n^{3/2},
          int_0^1exp{(-n,x^2)}sqrt{x},dx .$$
          The standard asymptotic trick of increasing the upper integral limit go to $infty$ allows us to explicitly calculate the integral with the gamma function. Using the Stirling approximation for the binomial and collecting results the answer so obtained is



          $$ sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim frac{Gamma(3/4)}{2sqrt{pi}}
          n^{1/4}2^{2n}$$






          share|cite|improve this answer









          $endgroup$



          Here is a first-term asymptotic analysis that gets the same result as Peter Taylor above, but with an explicit constant. Numerically, about 3 digits agreement are obtained for n ~ 1000.



          $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}sum_{k=0}^nexp{(-k^2/n)}sqrt{k}=binom{2n}{n}n^{3/2},frac{1}{n}sum_{k=0}^nexp{(-nbig(frac{k}{n}big)^2)}sqrt{frac{k}{n}}.$$



          In the 1st step the well-known expansion for the central binomial coefficients have been used and the 2nd I'm setting up for the interpretation of the sum as a Riemann integral as n $to infty$, i.e.,



          $$sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim binom{2n}{n}n^{3/2},
          int_0^1exp{(-n,x^2)}sqrt{x},dx .$$
          The standard asymptotic trick of increasing the upper integral limit go to $infty$ allows us to explicitly calculate the integral with the gamma function. Using the Stirling approximation for the binomial and collecting results the answer so obtained is



          $$ sum_{k=0}^n binom{2n}{n-k}sqrt{k} sim frac{Gamma(3/4)}{2sqrt{pi}}
          n^{1/4}2^{2n}$$







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered May 17 '18 at 17:39









          skbmooreskbmoore

          2,149211




          2,149211























              1












              $begingroup$

              Too long for a comment.



              Having fun playing with small numbers, I computed the values of



              $$S_n=sum_{i=0}^n binom{2n}{n-i} sqrt i$$ for $100 leq n leq 10000$ (step size $= 100$). For $n=1000$, the value is almost $1.375times 10^{6021}$ (!!).



              Performing a linear regression
              $$log(S_n)=a+ b n + c log(n)$$
              $$begin{array}{clclclclc}
              text{} & text{Estimate} & text{Standard Error} & text{Confidence Interval} \
              a & -1.08076 & 0.00069 & {-1.08213,-1.07939} \
              b & +1.38629 & approx 0 & {+1.38629,+1.38629} \
              c & +0.25239 & 0.00010 & {+0.25219,+0.25259} \
              end{array}$$ while using skbmoore's answer, the coefficients would be $ {-1.06223,1.38629,0.25000}$.






              share|cite|improve this answer









              $endgroup$


















                1












                $begingroup$

                Too long for a comment.



                Having fun playing with small numbers, I computed the values of



                $$S_n=sum_{i=0}^n binom{2n}{n-i} sqrt i$$ for $100 leq n leq 10000$ (step size $= 100$). For $n=1000$, the value is almost $1.375times 10^{6021}$ (!!).



                Performing a linear regression
                $$log(S_n)=a+ b n + c log(n)$$
                $$begin{array}{clclclclc}
                text{} & text{Estimate} & text{Standard Error} & text{Confidence Interval} \
                a & -1.08076 & 0.00069 & {-1.08213,-1.07939} \
                b & +1.38629 & approx 0 & {+1.38629,+1.38629} \
                c & +0.25239 & 0.00010 & {+0.25219,+0.25259} \
                end{array}$$ while using skbmoore's answer, the coefficients would be $ {-1.06223,1.38629,0.25000}$.






                share|cite|improve this answer









                $endgroup$
















                  1












                  1








                  1





                  $begingroup$

                  Too long for a comment.



                  Having fun playing with small numbers, I computed the values of



                  $$S_n=sum_{i=0}^n binom{2n}{n-i} sqrt i$$ for $100 leq n leq 10000$ (step size $= 100$). For $n=1000$, the value is almost $1.375times 10^{6021}$ (!!).



                  Performing a linear regression
                  $$log(S_n)=a+ b n + c log(n)$$
                  $$begin{array}{clclclclc}
                  text{} & text{Estimate} & text{Standard Error} & text{Confidence Interval} \
                  a & -1.08076 & 0.00069 & {-1.08213,-1.07939} \
                  b & +1.38629 & approx 0 & {+1.38629,+1.38629} \
                  c & +0.25239 & 0.00010 & {+0.25219,+0.25259} \
                  end{array}$$ while using skbmoore's answer, the coefficients would be $ {-1.06223,1.38629,0.25000}$.






                  share|cite|improve this answer









                  $endgroup$



                  Too long for a comment.



                  Having fun playing with small numbers, I computed the values of



                  $$S_n=sum_{i=0}^n binom{2n}{n-i} sqrt i$$ for $100 leq n leq 10000$ (step size $= 100$). For $n=1000$, the value is almost $1.375times 10^{6021}$ (!!).



                  Performing a linear regression
                  $$log(S_n)=a+ b n + c log(n)$$
                  $$begin{array}{clclclclc}
                  text{} & text{Estimate} & text{Standard Error} & text{Confidence Interval} \
                  a & -1.08076 & 0.00069 & {-1.08213,-1.07939} \
                  b & +1.38629 & approx 0 & {+1.38629,+1.38629} \
                  c & +0.25239 & 0.00010 & {+0.25219,+0.25259} \
                  end{array}$$ while using skbmoore's answer, the coefficients would be $ {-1.06223,1.38629,0.25000}$.







                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered May 18 '18 at 10:11









                  Claude LeiboviciClaude Leibovici

                  120k1157132




                  120k1157132






























                      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%2f2781195%2fwhat-is-the-asymptotic-order-of-2n-choose-0-sqrtn-2n-choose-1-sqrtn-1%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

                      Tonle Sap (See)

                      I get strange results when I access the Sqlitedatabase with Unity C# via XAMPP

                      Guatemaltekische Davis-Cup-Mannschaft