Central binomial coefficient ( $(n 2 n)$ )

The central binomial coefficient is the largest coefficient in the expansion of

(1 + 1)^{2 n}

:

(n 2 n) = \frac{( 2 n )!}{( n ! ) ^{2}} .

 Ancestors (5)

 Incoming links (4)

Elementary lower bound for the Chebyshev theta function
Past exam of the mathematics course of the University of Cambridge / 2002 / iii / Paper 25 / 1 / Solution
Past exam of the mathematics course of the University of Cambridge / 2019 / ia / Paper 2 / 3F / c / Solution
Past exam of the mathematics course of the University of Cambridge / 2023 / ii / Paper 3 / 1G / a / Solution

 View article source

 Discussion (0)

There are no discussions about this article yet.

 Articles by others on the same topic (1)

Central binomial coefficient by

Wikipedia Bot  1

The central binomial coefficient is a specific binomial coefficient that appears in combinatorial mathematics, particularly in counting problems and polynomial expansions.

 Read the full article

  See all articles in the same topic Create my own version