Carview!

CARVIEW

MOTORHOMES

Select Language

HTTP/2 301 server: nginx date: Sat, 03 Jan 2026 08:22:42 GMT content-type: text/html; charset=UTF-8 location: https://bylosingallgenerality.wordpress.com/2010/11/02/weighed-cointossing/ x-hacker: Want root? Visit join.a8c.com/hacker and mention this header. host-header: WordPress.com vary: accept, content-type, cookie x-pingback: https://bylosingallgenerality.wordpress.com/xmlrpc.php x-redirect-by: WordPress x-ac: 3.bom _dca MISS alt-svc: h3=":443"; ma=86400 strict-transport-security: max-age=31536000 server-timing: a8c-cdn, dc;desc=bom, cache;desc=MISS;dur=367.0 HTTP/2 200 server: nginx date: Sat, 03 Jan 2026 08:22:43 GMT content-type: text/html; charset=UTF-8 vary: Accept-Encoding x-hacker: Want root? Visit join.a8c.com/hacker and mention this header. host-header: WordPress.com vary: accept, content-type, cookie x-pingback: https://bylosingallgenerality.wordpress.com/xmlrpc.php link: ; rel=shortlink content-encoding: gzip x-ac: 3.bom _dca MISS alt-svc: h3=":443"; ma=86400 strict-transport-security: max-age=31536000 server-timing: a8c-cdn, dc;desc=bom, cache;desc=MISS;dur=596.0 Weighed cointossing | Woett's Blog

Weighed cointossing

Assume $S = \{s_1, s_2, .. \}$ is a set with $1 \le$ $s_1$ $\le s_2 \le ..$ , such that $\displaystyle \sum \dfrac{1}{s_i}$ diverges. Let $a_i = \pm 1$ , each with probability $\dfrac{1}{2}$ . What can we say about $\displaystyle \sum_{i=1}^n \dfrac{a_i}{s_i}$ when $n$ goes to infinity? Must there, for example, be infinitely many sign changes with probability $1$ ? It can’t be hard to show this for bounded $s_i$ , but what about $S = \aleph$ for example? I honestly have no clue whatsoever.

EDIT 22 Februari 2011
I can show that there is a positive probability that $\left|\displaystyle \sum_{i=1}^n \dfrac{a_i}{s_i}\right| > c$ for any $c$ , for $n$ large enough; Let $k = k(c)$ be the smallest integer such that $\displaystyle \sum_{i=1}^k \dfrac{1}{s_i} > c$ (note that this $k$ exists since the sum of $\dfrac{1}{s_i}$ is assumed to go to infinity).
Then either the probability that $\displaystyle \sum_{i=k+1}^n \dfrac{a_i}{s_i}$ $\ge 0$ is at least $\dfrac{1}{2}$ or the probability that $\displaystyle \sum_{i=k+1}^n \dfrac{a_i}{s_i}$ $\le 0$ is at least $\dfrac{1}{2}$ (*). Assume the first case (second case goes analogous), then we have: $P\left(\displaystyle \sum_{i=1}^n \dfrac{a_i}{s_i} > c\right) \ge P\left(\displaystyle \sum_{i=k+1}^n \dfrac{a_i}{s_i} \ge 0\right) \displaystyle \prod_{j=1}^k P(a_j = 1) \ge \dfrac{1}{2}\dfrac{1}{2^k} = \dfrac{1}{2^{k+1}} > 0$

(*) It is fun to note that both are the case, independent of $S$ . This can be used to show that $P\left(\left|\displaystyle \sum_{i=1}^n \dfrac{a_i}{s_i}\right| > c\right) \ge \dfrac{1}{2^k}$ for all $n$ $\ge$ $k$

This entry was posted on November 2, 2010 at 02:51 and is filed under Problem Solving. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

Woett's Blog

Weighed cointossing

Share this:

Related

Leave a comment Cancel reply