Purchase Solution

Binomial[2n, n] = Sum from k=0 to n of Binomial[n,k]^2

Not what you're looking for?

Ask Custom Question

Prove that (2n choose n) = the sum from k=0 to n of (n choose k) squared.

Purchase this Solution
Solution Summary

We give combinatorial proof of the identity Binomial[2n, n] = Sum from k=0 to n of Binomial[n,k]^2

Solution Preview

Consider a set S of 2N objects (e.g. the numbers 1, 2, 3,..., 2N). Then there are Binomial[2N,r] ways to choose r objects from this set. You can easily prove that in general Binomial[R,r] is the number of ways to choose r objects out of R, using the fact that there are n! ways to rearrange n objects. All possible ways to choose r objects can be realized by putting the R objects in some order and then taking the first r objects. The total number of ways you can put the list of R objects in some arbitrary order is R!. The total number of ways for a fixed ...

Purchase this Solution
Free BrainMass Quizzes
Solving quadratic inequalities

This quiz test you on how well you are familiar with solving quadratic inequalities.

Probability Quiz

Some questions on probability

Know Your Linear Equations

Each question is a choice-summary multiple choice question that will present you with a linear equation and then make 4 statements about that equation. You must determine which of the 4 statements are true (if any) in regards to the equation.

Graphs and Functions

This quiz helps you easily identify a function and test your understanding of ranges, domains , function inverses and transformations.

Geometry - Real Life Application Problems

Understanding of how geometry applies to in real-world contexts

View More Free Quizzes
Related BrainMass Solutions

  • Random walk problem

    You then get the expression: (1/2)^(2N)Summation of [Binomial[N,k]]^2 from k = 0 to N But the simplest proof that this binomial summation is equal to (1/2)^(2N) Binomial[2N,N] is by giving a combinatorial interpretation to the summation which is

  • Mean and Variance of Binomial Distribution

    ) =Sum{k=0,n}C(n,k)k^2p^k(1-p)^(n-k) =np+n(n-1)p^2 So, the variance of X is Var(X)=E(X^2)-[E(X)}^2 =np+n(n-1)p^2-(np)^2 =np-np^2 =np(1-p) Assume that X follows binomial distribution with parameters n and

  • Sequences and Series of Functions

    Therefore, if k starts from 0, the first number a0=(0+1)*0/(0+2) or (k+1)k/(k+2) in general. For the denominator of last number, k+2=11, k=9. Based on this induction, k is from 0 to 9.

  • Sum of Newton binomial coefficients with intermittent sign

    = sum_{k=0}^n (-1)^k ( "n above k") The latter is the sum you were requested to prove to be 0.

  • Radius of convergence of binomial series for fixed complex x

    505200 Radius of convergence of binomial series for fixed complex x The generalized binomial coefficient for z in C (complex) and k = 0, 1, 2, ... is 1 if k = 0 and ( k ) ( z ) = [z(z-1) ... (z - k +1)] / k! if k >=1.

  • Binomial expansion

    29579 Binomial Expansion Power (2x + y) to the 5th power In general the formula is as follow: (a+ b)^n= sum(k(up)=n, k(low)=0)[C(n, n-k) a^(n-k) b^(k)] where C(n, n-k) means n choose n-k. Here we have: a= 2x, b=y and n=5.

  • Binomial Coefficient and Factorial Notation

    (x+y)^n = sum(0,n)[n choose k] (x^k) (y^n-k) where n choose k is the binomial coefficient. Lets do an example... Expand (x+y)^3 = y^3 +3xy^2+3x^2y+x^3.

  • Multiple questions in probability and statistics

    We sum binomial probabilities for k from 0 to 10. This comes to 0.99064539 using exact binomial calculation. d) Probability that patient is taking prozac = 0.5 and that he takes placebo = 0.5.

  • Proof of the number of nodes in a binomial tree

    To make the statements easier we'll say that the notation N(Bj) is the number of nodes for for the binomial tree Bj. Step 1: Show that N(Bo) = 2^0 This is given as a part of the defintion of a binomial tree.

View More Related Solutions