How can we evaluate the sequence ${}_3C_1+{}_7C_2+{}_{11}C_3+dots+{}_{4n-1}C_n=$? [closed]












-1














I am new in combinatorics. How is the following sequence calculated?




${}_3C_1+{}_7C_2+{}_{11}C_3+dots+{}_{4n-1}C_n=$?











share|cite|improve this question















closed as off-topic by Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy Nov 26 at 13:31


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy

If this question can be reworded to fit the rules in the help center, please edit the question.









  • 5




    If you were new to combinatorics, wouldn't this be too hard?
    – Toby Mak
    Nov 26 at 11:56
















-1














I am new in combinatorics. How is the following sequence calculated?




${}_3C_1+{}_7C_2+{}_{11}C_3+dots+{}_{4n-1}C_n=$?











share|cite|improve this question















closed as off-topic by Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy Nov 26 at 13:31


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy

If this question can be reworded to fit the rules in the help center, please edit the question.









  • 5




    If you were new to combinatorics, wouldn't this be too hard?
    – Toby Mak
    Nov 26 at 11:56














-1












-1








-1


1





I am new in combinatorics. How is the following sequence calculated?




${}_3C_1+{}_7C_2+{}_{11}C_3+dots+{}_{4n-1}C_n=$?











share|cite|improve this question















I am new in combinatorics. How is the following sequence calculated?




${}_3C_1+{}_7C_2+{}_{11}C_3+dots+{}_{4n-1}C_n=$?








combinatorics discrete-mathematics






share|cite|improve this question















share|cite|improve this question













share|cite|improve this question




share|cite|improve this question








edited Nov 26 at 15:32

























asked Nov 26 at 11:09









Möbius

286




286




closed as off-topic by Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy Nov 26 at 13:31


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy

If this question can be reworded to fit the rules in the help center, please edit the question.




closed as off-topic by Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy Nov 26 at 13:31


This question appears to be off-topic. The users who voted to close gave this specific reason:


  • "This question is missing context or other details: Please improve the question by providing additional context, which ideally includes your thoughts on the problem and any attempts you have made to solve it. This information helps others identify where you have difficulties and helps them write answers appropriate to your experience level." – Saad, Claude Leibovici, Toby Mak, Jyrki Lahtonen, amWhy

If this question can be reworded to fit the rules in the help center, please edit the question.








  • 5




    If you were new to combinatorics, wouldn't this be too hard?
    – Toby Mak
    Nov 26 at 11:56














  • 5




    If you were new to combinatorics, wouldn't this be too hard?
    – Toby Mak
    Nov 26 at 11:56








5




5




If you were new to combinatorics, wouldn't this be too hard?
– Toby Mak
Nov 26 at 11:56




If you were new to combinatorics, wouldn't this be too hard?
– Toby Mak
Nov 26 at 11:56










3 Answers
3






active

oldest

votes


















1














Hint:



The $r$th term$T_{r+1}$ of $(x^a+x^b)^{4m-1}$
is $displaystylebinom{4m-1}r x^{a(4m-1-r)+br}$



$r=mimplies T_{m+1}=displaystylebinom{4m-1}m x^{a(4m-1-m)+bm}=binom{4m-1}m x^{m(3a+b)-a}$



If we set $3a+b=0iff b=-3a$



$T_{m+1}$ of $(x^a+x^{-3a})^{4m-1}$ will be $displaystylebinom{4m-1}m x^{-a}$



Set $a=-1,T_{r+1}$ in $(x^{-1}+x^3)^{4m-1}$ will be $displaystylebinom{4m-1}mx$



So, we need to find coefficient of $x$ in $$sum_{m=1}^n(x^{-1}+x^3)^{4m-1}$$ which is a finite Geometric Series.






share|cite|improve this answer





























    0














    Here are some java code to compute it.



    public static BigInteger ComputeSerie(int x){
    BigInteger sum=BigInteger.ZERO;
    for (int i=1;i<=x;i++)
    sum=sum.add(binomial(4*i-1,i));
    return sum;
    }
    public static BigInteger binomial(final int N, final int K) {
    BigInteger ret = BigInteger.ONE;
    for (int k = 0; k < K; k++) {
    ret = ret.multiply(BigInteger.valueOf(N-k))
    .divide(BigInteger.valueOf(k+1));
    }
    return ret;
    }
    System.out.println(ComputeSerie(20)) gives 2973189430714766571.





    share|cite|improve this answer





























      0














      Consider expansion of $$(1+x^4)^{n}=binom{n}0 x^{0}+binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n}$$ $$(1+x^4)^{n}-binom{n}0x^{0}=binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n} $$Dividing by $x$ on both sides $$frac{(1+x^4)^{n}-1}{x}=binom{n}1 x^{3}+binom{n}2 x^{7}+dots+binom{n}n x^{4n-1}$$ Differentiating w.r.t x on both sides $$frac{(x)(n)(1+x^4)^{n-1}(4x^3)-(1+x^4)^{n}(1)}{x^2}+frac{1}{x^2}=3binom{n}1 x^{2}+7binom{n}2 x^{6}+dots+(4n-1)binom{n}n x^{4n-2}$$ Substituting x=1 in the above equation $$3binom{n}1+7binom{n}2+dots+(4n-1)binom{n}n=(2n-1)2^n+1$$






      share|cite|improve this answer





















      • I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
        – Sai Satwik Kuppili
        Nov 26 at 12:43










      • This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
        – Möbius
        Nov 26 at 15:29


















      3 Answers
      3






      active

      oldest

      votes








      3 Answers
      3






      active

      oldest

      votes









      active

      oldest

      votes






      active

      oldest

      votes









      1














      Hint:



      The $r$th term$T_{r+1}$ of $(x^a+x^b)^{4m-1}$
      is $displaystylebinom{4m-1}r x^{a(4m-1-r)+br}$



      $r=mimplies T_{m+1}=displaystylebinom{4m-1}m x^{a(4m-1-m)+bm}=binom{4m-1}m x^{m(3a+b)-a}$



      If we set $3a+b=0iff b=-3a$



      $T_{m+1}$ of $(x^a+x^{-3a})^{4m-1}$ will be $displaystylebinom{4m-1}m x^{-a}$



      Set $a=-1,T_{r+1}$ in $(x^{-1}+x^3)^{4m-1}$ will be $displaystylebinom{4m-1}mx$



      So, we need to find coefficient of $x$ in $$sum_{m=1}^n(x^{-1}+x^3)^{4m-1}$$ which is a finite Geometric Series.






      share|cite|improve this answer


























        1














        Hint:



        The $r$th term$T_{r+1}$ of $(x^a+x^b)^{4m-1}$
        is $displaystylebinom{4m-1}r x^{a(4m-1-r)+br}$



        $r=mimplies T_{m+1}=displaystylebinom{4m-1}m x^{a(4m-1-m)+bm}=binom{4m-1}m x^{m(3a+b)-a}$



        If we set $3a+b=0iff b=-3a$



        $T_{m+1}$ of $(x^a+x^{-3a})^{4m-1}$ will be $displaystylebinom{4m-1}m x^{-a}$



        Set $a=-1,T_{r+1}$ in $(x^{-1}+x^3)^{4m-1}$ will be $displaystylebinom{4m-1}mx$



        So, we need to find coefficient of $x$ in $$sum_{m=1}^n(x^{-1}+x^3)^{4m-1}$$ which is a finite Geometric Series.






        share|cite|improve this answer
























          1












          1








          1






          Hint:



          The $r$th term$T_{r+1}$ of $(x^a+x^b)^{4m-1}$
          is $displaystylebinom{4m-1}r x^{a(4m-1-r)+br}$



          $r=mimplies T_{m+1}=displaystylebinom{4m-1}m x^{a(4m-1-m)+bm}=binom{4m-1}m x^{m(3a+b)-a}$



          If we set $3a+b=0iff b=-3a$



          $T_{m+1}$ of $(x^a+x^{-3a})^{4m-1}$ will be $displaystylebinom{4m-1}m x^{-a}$



          Set $a=-1,T_{r+1}$ in $(x^{-1}+x^3)^{4m-1}$ will be $displaystylebinom{4m-1}mx$



          So, we need to find coefficient of $x$ in $$sum_{m=1}^n(x^{-1}+x^3)^{4m-1}$$ which is a finite Geometric Series.






          share|cite|improve this answer












          Hint:



          The $r$th term$T_{r+1}$ of $(x^a+x^b)^{4m-1}$
          is $displaystylebinom{4m-1}r x^{a(4m-1-r)+br}$



          $r=mimplies T_{m+1}=displaystylebinom{4m-1}m x^{a(4m-1-m)+bm}=binom{4m-1}m x^{m(3a+b)-a}$



          If we set $3a+b=0iff b=-3a$



          $T_{m+1}$ of $(x^a+x^{-3a})^{4m-1}$ will be $displaystylebinom{4m-1}m x^{-a}$



          Set $a=-1,T_{r+1}$ in $(x^{-1}+x^3)^{4m-1}$ will be $displaystylebinom{4m-1}mx$



          So, we need to find coefficient of $x$ in $$sum_{m=1}^n(x^{-1}+x^3)^{4m-1}$$ which is a finite Geometric Series.







          share|cite|improve this answer












          share|cite|improve this answer



          share|cite|improve this answer










          answered Nov 26 at 11:42









          lab bhattacharjee

          222k15156274




          222k15156274























              0














              Here are some java code to compute it.



              public static BigInteger ComputeSerie(int x){
              BigInteger sum=BigInteger.ZERO;
              for (int i=1;i<=x;i++)
              sum=sum.add(binomial(4*i-1,i));
              return sum;
              }
              public static BigInteger binomial(final int N, final int K) {
              BigInteger ret = BigInteger.ONE;
              for (int k = 0; k < K; k++) {
              ret = ret.multiply(BigInteger.valueOf(N-k))
              .divide(BigInteger.valueOf(k+1));
              }
              return ret;
              }
              System.out.println(ComputeSerie(20)) gives 2973189430714766571.





              share|cite|improve this answer


























                0














                Here are some java code to compute it.



                public static BigInteger ComputeSerie(int x){
                BigInteger sum=BigInteger.ZERO;
                for (int i=1;i<=x;i++)
                sum=sum.add(binomial(4*i-1,i));
                return sum;
                }
                public static BigInteger binomial(final int N, final int K) {
                BigInteger ret = BigInteger.ONE;
                for (int k = 0; k < K; k++) {
                ret = ret.multiply(BigInteger.valueOf(N-k))
                .divide(BigInteger.valueOf(k+1));
                }
                return ret;
                }
                System.out.println(ComputeSerie(20)) gives 2973189430714766571.





                share|cite|improve this answer
























                  0












                  0








                  0






                  Here are some java code to compute it.



                  public static BigInteger ComputeSerie(int x){
                  BigInteger sum=BigInteger.ZERO;
                  for (int i=1;i<=x;i++)
                  sum=sum.add(binomial(4*i-1,i));
                  return sum;
                  }
                  public static BigInteger binomial(final int N, final int K) {
                  BigInteger ret = BigInteger.ONE;
                  for (int k = 0; k < K; k++) {
                  ret = ret.multiply(BigInteger.valueOf(N-k))
                  .divide(BigInteger.valueOf(k+1));
                  }
                  return ret;
                  }
                  System.out.println(ComputeSerie(20)) gives 2973189430714766571.





                  share|cite|improve this answer












                  Here are some java code to compute it.



                  public static BigInteger ComputeSerie(int x){
                  BigInteger sum=BigInteger.ZERO;
                  for (int i=1;i<=x;i++)
                  sum=sum.add(binomial(4*i-1,i));
                  return sum;
                  }
                  public static BigInteger binomial(final int N, final int K) {
                  BigInteger ret = BigInteger.ONE;
                  for (int k = 0; k < K; k++) {
                  ret = ret.multiply(BigInteger.valueOf(N-k))
                  .divide(BigInteger.valueOf(k+1));
                  }
                  return ret;
                  }
                  System.out.println(ComputeSerie(20)) gives 2973189430714766571.






                  share|cite|improve this answer












                  share|cite|improve this answer



                  share|cite|improve this answer










                  answered Nov 26 at 12:24









                  mathnoob

                  1,759422




                  1,759422























                      0














                      Consider expansion of $$(1+x^4)^{n}=binom{n}0 x^{0}+binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n}$$ $$(1+x^4)^{n}-binom{n}0x^{0}=binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n} $$Dividing by $x$ on both sides $$frac{(1+x^4)^{n}-1}{x}=binom{n}1 x^{3}+binom{n}2 x^{7}+dots+binom{n}n x^{4n-1}$$ Differentiating w.r.t x on both sides $$frac{(x)(n)(1+x^4)^{n-1}(4x^3)-(1+x^4)^{n}(1)}{x^2}+frac{1}{x^2}=3binom{n}1 x^{2}+7binom{n}2 x^{6}+dots+(4n-1)binom{n}n x^{4n-2}$$ Substituting x=1 in the above equation $$3binom{n}1+7binom{n}2+dots+(4n-1)binom{n}n=(2n-1)2^n+1$$






                      share|cite|improve this answer





















                      • I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
                        – Sai Satwik Kuppili
                        Nov 26 at 12:43










                      • This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
                        – Möbius
                        Nov 26 at 15:29
















                      0














                      Consider expansion of $$(1+x^4)^{n}=binom{n}0 x^{0}+binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n}$$ $$(1+x^4)^{n}-binom{n}0x^{0}=binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n} $$Dividing by $x$ on both sides $$frac{(1+x^4)^{n}-1}{x}=binom{n}1 x^{3}+binom{n}2 x^{7}+dots+binom{n}n x^{4n-1}$$ Differentiating w.r.t x on both sides $$frac{(x)(n)(1+x^4)^{n-1}(4x^3)-(1+x^4)^{n}(1)}{x^2}+frac{1}{x^2}=3binom{n}1 x^{2}+7binom{n}2 x^{6}+dots+(4n-1)binom{n}n x^{4n-2}$$ Substituting x=1 in the above equation $$3binom{n}1+7binom{n}2+dots+(4n-1)binom{n}n=(2n-1)2^n+1$$






                      share|cite|improve this answer





















                      • I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
                        – Sai Satwik Kuppili
                        Nov 26 at 12:43










                      • This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
                        – Möbius
                        Nov 26 at 15:29














                      0












                      0








                      0






                      Consider expansion of $$(1+x^4)^{n}=binom{n}0 x^{0}+binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n}$$ $$(1+x^4)^{n}-binom{n}0x^{0}=binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n} $$Dividing by $x$ on both sides $$frac{(1+x^4)^{n}-1}{x}=binom{n}1 x^{3}+binom{n}2 x^{7}+dots+binom{n}n x^{4n-1}$$ Differentiating w.r.t x on both sides $$frac{(x)(n)(1+x^4)^{n-1}(4x^3)-(1+x^4)^{n}(1)}{x^2}+frac{1}{x^2}=3binom{n}1 x^{2}+7binom{n}2 x^{6}+dots+(4n-1)binom{n}n x^{4n-2}$$ Substituting x=1 in the above equation $$3binom{n}1+7binom{n}2+dots+(4n-1)binom{n}n=(2n-1)2^n+1$$






                      share|cite|improve this answer












                      Consider expansion of $$(1+x^4)^{n}=binom{n}0 x^{0}+binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n}$$ $$(1+x^4)^{n}-binom{n}0x^{0}=binom{n}1 x^{4}+binom{n}2 x^{8}+dots+binom{n}n x^{4n} $$Dividing by $x$ on both sides $$frac{(1+x^4)^{n}-1}{x}=binom{n}1 x^{3}+binom{n}2 x^{7}+dots+binom{n}n x^{4n-1}$$ Differentiating w.r.t x on both sides $$frac{(x)(n)(1+x^4)^{n-1}(4x^3)-(1+x^4)^{n}(1)}{x^2}+frac{1}{x^2}=3binom{n}1 x^{2}+7binom{n}2 x^{6}+dots+(4n-1)binom{n}n x^{4n-2}$$ Substituting x=1 in the above equation $$3binom{n}1+7binom{n}2+dots+(4n-1)binom{n}n=(2n-1)2^n+1$$







                      share|cite|improve this answer












                      share|cite|improve this answer



                      share|cite|improve this answer










                      answered Nov 26 at 12:38









                      Sai Satwik Kuppili

                      538




                      538












                      • I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
                        – Sai Satwik Kuppili
                        Nov 26 at 12:43










                      • This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
                        – Möbius
                        Nov 26 at 15:29


















                      • I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
                        – Sai Satwik Kuppili
                        Nov 26 at 12:43










                      • This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
                        – Möbius
                        Nov 26 at 15:29
















                      I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
                      – Sai Satwik Kuppili
                      Nov 26 at 12:43




                      I think the question is not 3C1+7C2+...+(4n-1)Cn. It should be 3(nC1)+7(nC2)+..(4n-1)(nCn). Since in some text books nCr is represented as Cr
                      – Sai Satwik Kuppili
                      Nov 26 at 12:43












                      This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
                      – Möbius
                      Nov 26 at 15:29




                      This is not the answer. The question is 3C1+7C2+...+(4n-1)Cn
                      – Möbius
                      Nov 26 at 15:29



                      Popular posts from this blog

                      Aardman Animations

                      Are they similar matrix

                      “minimization” problem in Euclidean space related to orthonormal basis