## Return to Answer

1 [made Community Wiki]

I recall that the following simple "proof" of $\sum_{n=1}^\infty \frac{1}{n^2} = \frac{\pi^2}{6}$ is attributed to Euler:

Begin with the fact that for a polynomial $a_0 + a_1 x + \cdots + a_N x^N$ the sum of the inverses of the roots is given by $\sum_{n=1}^N \frac{1}{x_n} = -\frac{a_1}{a_0}$. (If you only remember the formula for the sum of the roots just make a change of variable $y=1/x$). Now consider the "polynomial" $$\frac{\sin\sqrt{x}}{\sqrt{x}} = 1 - \frac{x}{3!} + \cdots$$ whose roots are $x_n = (n\pi)^2$ for $n\in N$. By applying the aforementioned fact the desired result is immediate.
{"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": 6, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "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": false}, "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.919714629650116, "perplexity_flag": "head"}