# Thread:

1. Although the problem has been completely solved I'd like to comment that in general it can be proved that if

$a_k=\varphi(k+q)-\varphi(k),\; (q\in \mathbb{N}^*)\;\textrm{and}\; L=\lim_{k \to{+}\infty} \varphi(k)\in \mathbb{R}$

then,

$S=\displaystyle\sum_{k=1}^{+\infty}a_k=qL-\varphi(1)- \varphi (2)-\ldots - \varphi (q)$

In our case, the series can be inmediatly written in the form:

$S=-\displaystyle\sum_{k=1}^{+\infty}\left(\dfrac{1/2}{k+2}-\dfrac{1/2}{k}\right)$

that is, $q=2,\;\varphi(k)=1/2k$ . Then:

$S=-(2\cdot 0-\varphi(1)-\varphi(2))=\varphi(1)+\varphi(2)=\dfrac{1}{2}+\df rac{1}{4}=\dfrac{3}{4}$

Fernando Revilla
{"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.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": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9624747633934021, "perplexity_flag": "middle"}