# Thread:

1. ## Proof using Binomial Theorem

Hey all,

I am stuck on trying to prove $2^n = \sum_{r=0}^r \begin{pmatrix} n\\ r \end{pmatrix}$ using the Binomial Theorem, any ideas ? Thanks

2. Originally Posted by Oiler
Hey all,

I am stuck on trying to prove $2^n = \sum_{r=0}^r \begin{pmatrix} n\\ r \end{pmatrix}$ using the Binomial Theorem, any ideas ? Thanks
Hint:

2=1+1 (In most of the times)

3. Originally Posted by Oiler
$2^n = \sum_{r=0}^r \begin{pmatrix} n\\ r \end{pmatrix}$ using the Binomial Theorem
This is a standard theorem if we know that $\left( {a + b} \right)^n = \sum\limits_{k = 0}^n {\binom{n}{k}a^k b^{n - k} }$
Now let $a=1~\&~b=1$

NOTE you have a mistake. The upper limit in n.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 5, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.7976679801940918, "perplexity_flag": "middle"}