# Thread:

1. ## Different ways of Counting ....

(a) Let n be a nonnegative integer. Use the identity

$(1 + x)^n(1 + x)^n = (1 + x)$^ $(2n)$

to show that $\sum_{n=0}^{n}\binom{n}{k}^2 =\binom{2n}{n}$ (1)

(b) Prove (1) again by counting, in two different ways, the number of ways
of choosing n people from a set of n girls and n boys.

2. Originally Posted by shmounal
(a) Let n be a nonnegative integer. Use the identity

$(1 + x)^n(1 + x)^n = (1 + x)$^ $(2n)$

to show that $\sum_{n=0}^{n}\binom{n}{k}^2 =\binom{2n}{n}$ (1)

Compare the coefficient of $x^2$ in both expressions above.

Tonio

(b) Prove (1) again by counting, in two different ways, the number of ways
of choosing n people from a set of n girls and n boys.
.
{"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": 7, "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.3, "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": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.8842942118644714, "perplexity_flag": "middle"}