Fermi
·
Concept Library
·
Courses
·
Books
·
Problems
·
Simulations
·
Math Wiki
·
High School
Fermi
›
Problems
Grinstead-Snell-Probability
· Problem 35
Combinatorics
Mathematics · binomial-identities
Problem
Prove the following binomial identity
(
2
n
n
)
=
∑
j
=
0
n
(
n
j
)
2
.
\binom{2n}{n} = \sum_{j=0}^{n}\binom{n}{j}^2.
(
n
2
n
)
=
j
=
0
∑
n
(
j
n
)
2
.
Hint: Consider an urn with
n
n
n
red balls and
n
n
n
blue balls inside. Show that each side of the equation equals the number of ways to choose
n
n
n
balls from the urn.
Related theory
Binomial Coefficient Identities
Browse the problem library