# Thread:

1. ## Probability of Eventual Return in Random Walk

The probability of eventual return is given by:
$f_{2} + f_{4} + f_{6} + ...+ f_{\infty} = 1$

where $f_{n}$ = Probability of return at Time Period n.
Note that returns must be in even numbers, as a +1 needs -1 to cancel each other out.

Ok, I understand the theory, but I cannot find a suitable proof.

Edit: Proof found. Problem solved.

$f_{n}$ is given by $f_{2n}= u_{2n-2} - u_{2n}$ where $u_{2n}={2n \choose n}2^{-2n}$

So, $f_{2} + f_{4} + f_{6} + ...+ f_{\infty} = u_{0} - u_{2} + u_{2} - u_{4} + ..... = u_{0} = 1$

Still, I'll be very grateful if anyone can explain this Theorem:
$f_{2n}= u_{2n-2} - u_{2n}$
{"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.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.9146713614463806, "perplexity_flag": "middle"}