# Show two to the power of n is the sum of n choose k from k=0 to k=n

$$2^n = \sum_{k=0}^{k=n} \frac{n!}{k!(n-k)!}$$

Note by Jack Han
2 years, 8 months ago

MarkdownAppears as
*italics* or _italics_ italics
**bold** or __bold__ bold
- bulleted- list
• bulleted
• list
1. numbered2. list
1. numbered
2. list
Note: you must add a full line of space before and after lists for them to show up correctly
paragraph 1paragraph 2

paragraph 1

paragraph 2

[example link](https://brilliant.org)example link
> This is a quote
This is a quote
    # I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
# I indented these lines
# 4 spaces, and now they show
# up as a code block.

print "hello world"
MathAppears as
Remember to wrap math in $$...$$ or $...$ to ensure proper formatting.
2 \times 3 $$2 \times 3$$
2^{34} $$2^{34}$$
a_{i-1} $$a_{i-1}$$
\frac{2}{3} $$\frac{2}{3}$$
\sqrt{2} $$\sqrt{2}$$
\sum_{i=1}^3 $$\sum_{i=1}^3$$
\sin \theta $$\sin \theta$$
\boxed{123} $$\boxed{123}$$

Sort by:

Hint: What is the binomial expansion of $$(1+x)^n$$? What happens when $$x=1$$?

Alternatively you can prove this via induction. Use the properties of Pascal Identity: $$\dbinom{n-1}{k-1} + \dbinom{n-1}k = \dbinom nk$$.

Or see this: Binomial Theorem - N Choose K.

- 2 years, 8 months ago