<?xml version="1.0" encoding="iso-8859-1" ?> 
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.1 plus MathML 2.0//EN" 
"http://www.w3.org/Math/DTD/mathml2/xhtml-math11-f.dtd" > 
<?xml-stylesheet type="text/css" href="excessheads.css"?> 
<html  
xmlns="http://www.w3.org/1999/xhtml"  
><head><title></title> 
<meta http-equiv="Content-Type" content="text/html; charset=iso-8859-1" /> 
<meta name="generator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)" /> 
<meta name="originator" content="TeX4ht (http://www.cse.ohio-state.edu/~gurari/TeX4ht/)" /> 
<!-- xhtml,mozilla --> 
<meta name="src" content="excessheads.tex" /> 
<meta name="date" content="2010-11-02 06:28:00" /> 
<link rel="stylesheet" type="text/css" href="excessheads.css" /> 
</head><body 
>
<!--l. 8--><p class="noindent" >Steven R. Dunbar <br 
class="newline" />Department of Mathematics <br 
class="newline" />203 Avery Hall <br 
class="newline" />University of Nebraska-Lincoln <br 
class="newline" />Lincoln, NE 68588-0130 <br 
class="newline" /><span 
class="cmtt-12">http://www.math.unl.edu </span><br 
class="newline" />Voice: 402-472-3731 <br 
class="newline" />Fax: 402-472-8466                  </p>
<div class="center" 
>
<!--l. 1--><p class="noindent" >
</p><!--l. 7--><p class="noindent" > <span 
class="cmbx-12x-x-144">Math 489/Math 889</span><br />
<span 
class="cmbx-12x-x-144">Stochastic Processes and</span><br />
<span 
class="cmbx-12x-x-144">Advanced Mathematical Finance</span><br />
<span 
class="cmbx-12x-x-144">Dunbar, Fall 2010</span>
</p></div>
<!--l. 19--><p class="noindent" >__________________________________________________________________________
</p>
<div class="center" 
>
<!--l. 21--><p class="noindent" >
</p><!--l. 21--><p class="noindent" ><span 
class="cmr-17">The Absolute Excess of Heads over Tails</span></p></div>
<!--l. 23--><p class="indent" >   _______________________________________________________________________
</p><!--l. 25--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/rating.png" alt="Rating"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-1000"></a>Rating</h3>
<!--l. 29--><p class="noindent" >Mathematically Mature: may contain mathematics beyond calculus with
proofs.
</p><!--l. 32--><p class="indent" >   _______________________________________________________________________________________________
</p><!--l. 34--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/question_mark.png" alt="QuestionofDay"  
 />
                                                                          

                                                                          
</p>
   <h3 class="likesectionHead"><a 
 id="x1-2000"></a>Question of the Day</h3>
<!--l. 35--><p class="noindent" >What does the law of averages have to say about the probability of having a fixed
lead of say 20 Heads or more over Tails or 20 Tails or more over Heads
at the end of a coin flipping game of some fixed duration? What does
the Weak Law of Large Numbers have to say about having a fixed lead?
What does the Weak Law have to say about having a proportional lead,
say 1%? What does the Central Limit Theorem have to say about the
lead?
</p><!--l. 43--><p class="indent" >   _______________________________________________________________________________________________
</p><!--l. 45--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/keyconcepts.png" alt="Key Concepts"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-3000"></a>Key Concepts</h3>
<!--l. 47--><p class="noindent" >
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-3002x1">The probability that the number of heads exceeds the number of tails
      or the number of tails exceeds the number of heads in a sequence of
      coin-flips by some fixed amount can be estimated with the Central
      Limit Theorem and the probability gets close to <!--l. 53--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math>
      as the number of tosses grows large.
      </li>
      <li 
  class="enumerate" id="x1-3004x2">The probability that the number of heads exceeds the number of tails
      or the number of tails exceeds the number of heads in a sequence of
      coin-flips by some fixed proportion can be estimated with the Central
      Limit Theorem and the probability gets close to <!--l. 59--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn></mrow></math>
      as the number of tosses grows large.</li></ol>
<!--l. 62--><p class="noindent" >__________________________________________________________________________
</p><!--l. 64--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/vocabulary.png" alt="Vocabulary"  
 />
                                                                          

                                                                          
</p>
   <h3 class="likesectionHead"><a 
 id="x1-4000"></a>Vocabulary</h3>
<!--l. 66--><p class="noindent" >
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-4002x1">The <span 
class="cmbx-12">half-integer correction</span>, also called the <span 
class="cmbx-12">continuity correction</span>
      arises because the distribution of the binomial distribution is a discrete
      distribution, while the standard normal distribution is a continuous
      distribution.</li></ol>
<!--l. 74--><p class="noindent" >__________________________________________________________________________
</p><!--l. 76--><p class="indent" >   <img 
src="../../../../CommonInformation/Lessons/mathematicalideas.png" alt="Mathematical Ideas"  
 />
</p>
   <h3 class="likesectionHead"><a 
 id="x1-5000"></a>Mathematical Ideas</h3>
<!--l. 79--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-6000"></a>Introduction</h4>
<!--l. 81--><p class="noindent" >Probability theory generally has two classes of theorems about the results of
coin-tossing games and therefore random walks:
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-6002x1">Those  theorems  that  tell  how  well-behaved  and  natural  are  the
      outcomes of typical coin-tossing games and random walks. The Weak
      Law of Large Numbers, the Strong Law of Large Numbers and the
      Central Limit Theorem fall into this category.
      </li>
      <li 
  class="enumerate" id="x1-6004x2">Those theorems that tell how strange and unnatural are the outcomes
      of typical coin-tossing games and random walks. The Arcsine Law and
      the Law of the Iterated Logarithm are good examples in this category.</li></ol>
<!--l. 96--><p class="indent" >   In this section we will ask two related questions about the net fortune in a
coin-tossing game:
                                                                          

                                                                          
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-6006x1">What is the probability of an excess of a fixed number of heads over
      tails or tails over heads at some fixed time in the coin-flipping game?
      </li>
      <li 
  class="enumerate" id="x1-6008x2">What is the probability that the number of heads exceeds the number
      of tails or the number of tails exceeds the number of heads by some
      fixed fraction of the number of tosses?</li></ol>
<!--l. 108--><p class="noindent" >Using the Central Limit Theorem, we will be able to provide precise answers to each
question and then to apply the ideas to interesting questions in gambling and
finance.
</p><!--l. 112--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-7000"></a>The Half-Integer Correction to the Central Limit Theorem</h4>
<!--l. 114--><p class="noindent" >Often when using the Central Limit Theorem to approximate a discrete
distribution, especially the binomial distribution, we adopt the <span 
class="cmbx-12">half-integer</span>
<span 
class="cmbx-12">correction</span>, also called the <span 
class="cmbx-12">continuity correction</span>. The correction arises
because the binomial distribution has a discrete distribution while the
standard normal distribution has a continuous distribution. For any integer
<!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>s</mi></mrow></math> and real
value <!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>h</mi></mrow></math> with
<!--l. 123--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>h</mi> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn></mrow></math> the binomial
random variable <!--l. 124--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>
has <!--l. 124--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>s</mi></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>h</mi></mrow></mfenced></mrow></math>,
yet the corresponding Central Limit Theorem approximation
with the standard normal cumulative distribution function,
<!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2264;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mi 
>h</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced></mrow></math> increases as
<!--l. 127--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>h</mi></mrow></math> increases
from <!--l. 128--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn></mrow></math> to
<!--l. 128--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math>. It is customary
to take <!--l. 128--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>h</mi> <mo 
class="MathClass-rel">=</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math>
to interpolate the difference. This choice is also justified by looking at the
approximation of the binomial with the normal.
</p><!--l. 132--><p class="indent" >   Symbolically, the half-integer correction to the Central Limit Theorem
is
                                                                          

                                                                          
</p><!--tex4ht:inline--><!--l. 138--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
 <mtr><mtd 
columnalign="right" class="align-odd"><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>a</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>b</mi></mrow></mfenced></mtd> <mtd 
class="align-even"> <mo 
class="MathClass-rel">&#x2248;</mo><msubsup><mrow 
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>a</mi><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>n</mi><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi><mi 
>p</mi><mi 
>q</mi></mrow></msqrt></mrow><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>b</mi><mo 
class="MathClass-bin">+</mo><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>n</mi><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi><mi 
>p</mi><mi 
>q</mi></mrow></msqrt></mrow></msubsup 
>   <mfrac><mrow 
><mn>1</mn></mrow>
<mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac><mo class="qopname"> exp</mo><!--nolimits--><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mi 
>u</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mi 
>d</mi><mi 
>u</mi><mspace width="2em"/></mtd>    <mtd 
columnalign="right" class="align-label"></mtd> <mtd 
class="align-label">
 <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>              <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>a</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>n</mi><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi><mi 
>p</mi><mi 
>q</mi></mrow></msqrt> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>Z</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>b</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>n</mi><mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi><mi 
>p</mi><mi 
>q</mi></mrow></msqrt></mrow></mfenced><mspace width="2em"/></mtd> <mtd 
columnalign="right" class="align-label"></mtd> <mtd 
class="align-label">
   <mspace width="2em"/></mtd></mtr></mtable></math>
<!--l. 139--><p class="noindent" >for integers <!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>a</mi></mrow></math>
and <!--l. 139--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>b</mi></mrow></math>.
</p>
   <hr class="figure" /><div class="figure" 
><table class="figure"><tr class="figure"><td class="figure" 
>
                                                                          

                                                                          
<a 
 id="x1-70011"></a>
                                                                          

                                                                          
<!--l. 143--><p class="noindent" ><img 
src="halfintegercorrection.png" alt="PIC"  
 />
<br /> </p><table class="caption" 
><tr style="vertical-align:baseline;" class="caption"><td class="id">Figure&#x00A0;1: </td><td  
class="content">The half-integer correction</td></tr></table><!--tex4ht:label?: x1-70011 -->
                                                                          

                                                                          
   </td></tr></table></div><hr class="endfigure" />
   <h4 class="likesubsectionHead"><a 
 id="x1-8000"></a>The absolute excess of heads over tails</h4>
<!--l. 150--><p class="noindent" >Consider the sequence of independent random variables
<!--l. 150--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></math> which take
values <!--l. 151--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math> with
probability <!--l. 151--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math>
and <!--l. 151--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></math> with
probability <!--l. 152--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math>.
This is a mathematical model of a fair coin flip game where a
<!--l. 153--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math> results from &#x201C;heads&#x201D;
on the <!--l. 153--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>i</mi></mrow></math>th coin
toss and a <!--l. 154--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></math> results
from &#x201C;tails&#x201D;. Let <!--l. 154--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>
and <!--l. 154--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>
be the number of heads and tails respectively in
<!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math> flips.
Then <!--l. 155--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msubsup><mrow 
><mo 
class="MathClass-op"> &#x2211;</mo>
  <!--nolimits--></mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <msub><mrow 
><mi 
>H</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-bin">&#x2212;</mo> <msub><mrow 
><mi 
>L</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>
counts the difference between the number of heads and tails, an excess of heads if
positive, and a &#x201C;negative excess&#x201D;, i.e.&#x00A0;a deficit, if negative. Rather than the clumsy
extended phrase &#x201C;the number of heads exceeds the number of tails or the number
of tails exceeds the number of heads&#x201D; we can say &#x201C;the absolute excess of heads
<!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">|</mo></mrow></math>.&#x201D; The
value <!--l. 162--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>
also represents the net &#x201C;winnings&#x201D;, positive or negative, of a gambler in a fair coin
flip game.
</p>
   <div class="newtheorem">
<!--l. 166--><p class="noindent" ><span class="head">
<a 
 id="x1-8001r1"></a>
<span 
class="cmbx-12">Corollary 1.</span>  </span><span 
class="cmti-12">Under the assumption that </span><!--l. 167--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mo 
class="MathClass-bin">+</mo><mn>1</mn></mrow></math>
<span 
class="cmti-12">with probability </span><!--l. 167--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math>
<span 
class="cmti-12">and </span><!--l. 168--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn></mrow></math>
<span 
class="cmti-12">with probability </span><!--l. 168--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></math><span 
class="cmti-12">,</span>
                                                                          

                                                                          
<span 
class="cmti-12">and </span><!--l. 168--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msubsup><mrow 
><mo 
class="MathClass-op"> &#x2211;</mo>
  <!--nolimits--></mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mi 
>n</mi></mrow></msubsup 
><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
></mrow></math><span 
class="cmti-12">,</span>
<span 
class="cmti-12">then for an integer </span><!--l. 169--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>s</mi></mrow></math>
</p>
   <div class="math-display"><!--l. 170--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                      <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">|</mo> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>s</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2265;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced>
</mrow></math></div>
<!--l. 172--><p class="nopar" > <span 
class="cmti-12">where </span><!--l. 172--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>Z</mi></mrow></math>
<span 
class="cmti-12">is a standard normal random variable with mean </span><!--l. 172--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn></mrow></math>
<span 
class="cmti-12">and variance </span><!--l. 173--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math><span 
class="cmti-12">.</span>
</p>
   </div>
<!--l. 176--><p class="indent" >
</p>
   <div class="proof">
<!--l. 177--><p class="indent" >   <span class="head">
<span 
class="cmti-12">Proof.</span> </span>Note that <!--l. 177--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></mrow></math>
and <!--l. 177--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-rel">=</mo><mo class="qopname"> Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>Y</mi> </mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>1</mn></mrow></math>.
                                                                          

                                                                          
</p><!--tex4ht:inline--><!--l. 186--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
      <mtr><mtd 
columnalign="right" class="align-odd"><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">|</mo> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>s</mi></mrow></mfenced></mtd>      <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>s</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>s</mi></mrow></mfenced><mspace width="2em"/></mtd>                                   <mtd 
columnalign="right" class="align-label"></mtd>      <mtd 
class="align-label">
      <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>s</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></mfenced><mspace width="2em"/></mtd>                      <mtd 
columnalign="right" class="align-label"></mtd>      <mtd 
class="align-label">
      <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>s</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt> <mo 
class="MathClass-rel">&#x2264;</mo> <msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt> <mo 
class="MathClass-rel">&#x2264;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced><mspace width="2em"/></mtd>      <mtd 
columnalign="right" class="align-label"></mtd>      <mtd 
class="align-label">
      <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                <mtd 
class="align-even"> <mo 
class="MathClass-rel">&#x2248;</mo> <mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>s</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>Z</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced><mspace width="2em"/></mtd>           <mtd 
columnalign="right" class="align-label"></mtd>      <mtd 
class="align-label">
      <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2265;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>s</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced><mspace width="2em"/></mtd>                                <mtd 
columnalign="right" class="align-label"></mtd>      <mtd 
class="align-label">
      <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                <mtd 
class="align-even"><mspace width="2em"/></mtd>                                                         <mtd 
columnalign="right" class="align-label">
   </mtd></mtr></mtable></math>
                                                                         &#x25A1;
   </div>
<!--l. 189--><p class="indent" >   The crucial step occurs at the approximation, and uses the Central
Limit Theorem. More precise statements of the Central Limit Theorem
such as the Berry-Esseen inequality can turn the approximation into a
inequality.
</p><!--l. 194--><p class="indent" >   If we take <!--l. 194--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>s</mi></mrow></math>
to be fixed we now have the answer to our first question: The probability of an
absolute excess of heads over tails greater than a fixed amount in a fair game of
duration <!--l. 196--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>
approaches <!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math>
as <!--l. 197--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>
increases.
</p><!--l. 199--><p class="indent" >   The Central Limit Theorem in the form of the half-integer
correction above provides an alternative proof of the Weak Law of
Large Numbers for the specific case of the binomial random variable
<!--l. 202--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></math>. In
fact,
                                                                          

                                                                          
</p><!--tex4ht:inline--><!--l. 208--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
              <mtr><mtd 
columnalign="right" class="align-odd"><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mfenced separators="" 
open="|"  close="|" ><mrow><mfrac><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow>
 <mrow 
><mi 
>n</mi></mrow></mfrac> </mrow></mfenced> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>&#x03F5;</mi></mrow></mfenced></mtd>              <mtd 
class="align-even"> <mo 
class="MathClass-rel">&#x2248;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2265;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>&#x03F5;</mi><mi 
>n</mi> <mo 
class="MathClass-bin">+</mo> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced><mspace width="2em"/></mtd>                     <mtd 
columnalign="right" class="align-label"></mtd>              <mtd 
class="align-label">
              <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                        <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2265;</mo> <mi 
>&#x03F5;</mi><msqrt><mrow><mi 
>n</mi></mrow></msqrt> <mo 
class="MathClass-bin">+</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>0</mn><mspace width="2em"/></mtd>              <mtd 
columnalign="right" class="align-label"></mtd>              <mtd 
class="align-label">
   <mspace width="2em"/></mtd></mtr></mtable></math>
<!--l. 209--><p class="noindent" >as <!--l. 209--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>.
</p><!--l. 211--><p class="indent" >   Rewriting <!--l. 211--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mfenced separators="" 
open="|"  close="|" ><mrow><mfrac><mrow 
><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow>
 <mrow 
><mi 
>n</mi></mrow></mfrac> </mrow></mfenced> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>&#x03F5;</mi></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mfenced separators="" 
open="|"  close="|" ><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x003E;</mo> <mi 
>&#x03F5;</mi><mi 
>n</mi></mrow></mfenced></mrow></math>
this restatement of the Weak Law actually provides the answer to our
second question: The probability that the absolute excess of heads over
tails is greater than a fixed fraction of the flips in a fair game of duration
<!--l. 215--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math> approaches
<!--l. 215--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn></mrow></math> as
<!--l. 216--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>
increases.
</p><!--l. 218--><p class="indent" >   Finally, this gives an estimate on the central probability in a binomial
distribution.
</p>
   <div class="newtheorem">
<!--l. 220--><p class="noindent" ><span class="head">
<a 
 id="x1-8002r2"></a>
<span 
class="cmbx-12">Corollary 2.</span>  </span>
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 221--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                       <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo> <mo 
class="MathClass-rel">&#x003C;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced> <mo 
class="MathClass-rel">&#x2192;</mo> <mn>0</mn>
</mrow></math></div>
<!--l. 223--><p class="nopar" > <span 
class="cmti-12">as </span><!--l. 223--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math><span 
class="cmti-12">.</span>
</p>
   </div>
<!--l. 226--><p class="indent" >   We can estimate this further
</p><!--tex4ht:inline--><!--l. 235--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mtable 
columnalign="left" class="align-star">
    <mtr><mtd 
columnalign="right" class="align-odd"><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo> <mo 
class="MathClass-rel">&#x003C;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfenced></mtd>    <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo>   <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac><msubsup><mrow 
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><msup><mrow 
><mi 
>e</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mi 
>u</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></msup 
><mspace width="0em" class="thinspace"/><mi 
>d</mi><mi 
>u</mi><mspace width="2em"/></mtd>                  <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
    <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                      <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo>   <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac><msubsup><mrow 
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>2</mn><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></msubsup 
><mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <msup><mrow 
><mi 
>u</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn> <mo 
class="MathClass-bin">+</mo> <msup><mrow 
><mi 
>u</mi></mrow><mrow 
><mn>4</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mn>8</mn> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x2026;</mo><mspace width="0em" class="thinspace"/><mi 
>d</mi><mi 
>u</mi><mspace width="2em"/></mtd>    <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
    <mspace width="2em"/></mtd></mtr><mtr><mtd 
columnalign="right" class="align-odd"></mtd>                      <mtd 
class="align-even"> <mo 
class="MathClass-rel">=</mo>   <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></mfrac> <mo 
class="MathClass-bin">&#x2212;</mo>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mn>2</mn><mn>4</mn><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msup><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>3</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></msup 
></mrow></mfrac> <mo 
class="MathClass-bin">+</mo>     <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><mn>6</mn><mn>4</mn><mn>0</mn><msqrt><mrow><mn>2</mn><mi 
>&#x03C0;</mi></mrow></msqrt></mrow></mfrac>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msup><mrow 
><mi 
>n</mi></mrow><mrow 
><mn>5</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></msup 
></mrow></mfrac> <mo 
class="MathClass-bin">+</mo> <mo 
class="MathClass-op">&#x2026;</mo><mo 
class="MathClass-punc">.</mo><mspace width="2em"/></mtd>     <mtd 
columnalign="right" class="align-label"></mtd>    <mtd 
class="align-label">
   <mspace width="2em"/></mtd></mtr></mtable></math>
<!--l. 236--><p class="noindent" >So we see that <!--l. 236--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mn>0</mn></mrow></mfenced></mrow></math> goes
to zero at the rate of <!--l. 236--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mi 
>n</mi></mrow></msqrt></mrow></math>.
                                                                          

                                                                          
</p><!--l. 239--><p class="noindent" >
</p>
   <h5 class="likesubsubsectionHead"><a 
 id="x1-9000"></a>Illustration 1</h5>
<!--l. 241--><p class="noindent" >What is the probability that the number of heads exceeds the number of tails by more
than <!--l. 242--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mn>0</mn></mrow></math>
or the number of tails exceeds the number of heads by more than
<!--l. 243--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mn>0</mn></mrow></math> after
<!--l. 243--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>5</mn><mn>0</mn><mn>0</mn></mrow></math> tosses
of a fair coin? By the proposition, this is:
</p>
   <div class="math-display"><!--l. 246--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                     <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>T</mi></mrow><mrow 
><mi 
>n</mi></mrow></msub 
><mo 
class="MathClass-rel">|</mo> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>2</mn><mn>0</mn></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2265;</mo> <mn>2</mn><mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>5</mn><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mn>5</mn><mn>0</mn><mn>0</mn></mrow></msqrt></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>3</mn><mn>4</mn><mn>7</mn><mn>7</mn><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 249--><p class="nopar" > This is a reasonably large probability, and is larger than many people would
expect.
</p><!--l. 252--><p class="indent" >   Here is a graph of the probability of at least
<!--l. 252--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>s</mi></mrow></math> excess
heads in <!--l. 252--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>5</mn><mn>0</mn><mn>0</mn></mrow></math>
tosses of a fair coin: </p><hr class="figure" /><div class="figure" 
><table class="figure"><tr class="figure"><td class="figure" 
>
                                                                          

                                                                          
<a 
 id="x1-90012"></a>
                                                                          

                                                                          
<!--l. 256--><p class="noindent" ><img 
src="prob_excess_heads.png" alt="PIC"  
 />
<br />                 </p><table class="caption" 
><tr style="vertical-align:baseline;" class="caption"><td class="id">Figure&#x00A0;2:                       </td><td  
class="content">Probability                       of
<!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mi 
>s</mi></math>
excess                                         heads                                         in
<!--l. 258--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mn>5</mn><mn>0</mn><mn>0</mn></math>
tosses</td></tr></table><!--tex4ht:label?: x1-90012 -->
                                                                          

                                                                          
   </td></tr></table></div><hr class="endfigure" />
   <h5 class="likesubsubsectionHead"><a 
 id="x1-10000"></a>Illustration 2</h5>
<!--l. 263--><p class="noindent" >What is the probability that there is &#x201C;about the same number of heads
as tails&#x201D; in 500 tosses? Here we interpret &#x201C;about the same&#x201D; as within
<!--l. 265--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>5</mn></mrow></math>, that
is, an absolute difference of 1% or less of the number of tosses. Note that since
<!--l. 266--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>5</mn><mn>0</mn><mn>0</mn></mrow></math> is even, so
the difference in the number of heads and tails cannot be an odd number, so must be
either <!--l. 268--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn></mrow></math>,
<!--l. 268--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn></mrow></math> or
<!--l. 268--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>4</mn></mrow></math>.
</p>
   <div class="par-math-display"><!--l. 270--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
                      <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><msub><mrow 
><mi 
>S</mi></mrow><mrow 
><mn>5</mn><mn>0</mn><mn>0</mn></mrow></msub 
><mo 
class="MathClass-rel">|</mo> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>5</mn></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mo 
class="MathClass-rel">|</mo><mi 
>Z</mi><mo 
class="MathClass-rel">|</mo><mo 
class="MathClass-rel">&#x2264;</mo> <mn>5</mn><mo 
class="MathClass-punc">.</mo><mn>5</mn><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mn>5</mn><mn>0</mn><mn>0</mn></mrow></msqrt></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>1</mn><mn>9</mn><mn>4</mn><mn>3</mn>
</mrow></math></div>
<!--l. 273--><p class="nopar" > so it would be somewhat unusual (in that it occurs in less than 20% of games) to
have the number of heads and tails so close.
</p><!--l. 276--><p class="noindent" >
</p>
   <h5 class="likesubsubsectionHead"><a 
 id="x1-11000"></a>Illustration 3</h5>
<!--l. 278--><p class="noindent" >Suppose you closely follow a stock recommendation source whose methods are based on
technical analysis. You accept every bit of advice from this source about trading stocks.
You choose <!--l. 282--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn></mrow></math>
stocks to buy, sell or hold every day based on the recommendations. Each day
for each stock you will gain or lose money based on the advice. Note
                                                                          

                                                                          
that it is possible to gain money even if the advice says the stocks will
decrease in value, say by short-selling or using put options. How good
can this strategy be? We will make this vague question precise by
asking &#x201C;How good does the information from the technical analysis have
to be so that the probability of losing money over a year&#x2019;s time is
<!--l. 289--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math> in
<!--l. 289--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn><mo 
class="MathClass-punc">,</mo><mn>0</mn><mn>0</mn><mn>0</mn></mrow></math>?&#x201D;
</p><!--l. 291--><p class="indent" >   The <!--l. 291--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn></mrow></math> stocks over
<!--l. 291--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mn>6</mn><mn>0</mn></mrow></math> business days in a
year means that there <!--l. 292--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mo 
class="MathClass-punc">,</mo><mn>6</mn><mn>0</mn><mn>0</mn></mrow></math>
daily gains or losses. Denote each daily gain or loss as
<!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></math>, if the advice is
correct you will gain <!--l. 293--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></mrow></math>
and if the advice is wrong you will lose
<!--l. 294--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>0</mn></mrow></math>. We want the total change
<!--l. 295--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><!--mstyle 
class="text"--><mtext  >&#x00A0;annual</mtext><!--/mstyle--></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msubsup><mrow 
><mo 
class="MathClass-op"> &#x2211;</mo>
  <!--nolimits--></mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn></mrow></msubsup 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x003E;</mo> <mn>0</mn></mrow></math> and we will measure
that by asking that <!--l. 296--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><!--mstyle 
class="text"--><mtext  >&#x00A0;annual</mtext><!--/mstyle--></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>0</mn></mrow></mfenced></mrow></math>
be small. In the terms of this section, we are interested in the complementary
probability of an excess of successes over failures.
</p><!--l. 300--><p class="indent" >   We assume that the changes are random variables, identically distributed,
independent and the moments of all the random variables are finite. We will make
specific assumptions about the distribution later, for now these assumptions are
sufficient to apply the Central Limit Theorem. Then the total change
<!--l. 304--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><!--mstyle 
class="text"--><mtext  >&#x00A0;annual</mtext><!--/mstyle--></mrow></msub 
> <mo 
class="MathClass-rel">=</mo><msubsup><mrow 
><mo 
class="MathClass-op"> &#x2211;</mo>
  <!--nolimits--></mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn></mrow></msubsup 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
></mrow></math>
is approximately normally distributed with mean
<!--l. 305--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">=</mo> <mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced></mrow></math> and
variance <!--l. 306--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn> <mo 
class="MathClass-bin">&#x22C5;</mo><mo class="qopname"> Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
>
<mn>1</mn></mrow></msub 
></mrow></mfenced></mrow></math>.
Note that here again we are using the uncentered and unscaled version of the
Central Limit Theorem. In symbols
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 309--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
            <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><mi 
>a</mi> <mo 
class="MathClass-rel">&#x2264;</mo><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn></mrow></munderover 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>b</mi></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn></mrow></msqrt><mi 
>&#x03C0;</mi><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac><msubsup><mrow 
><mo 
class="MathClass-op"> &#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mi 
>a</mi></mrow><mrow 
><mi 
>b</mi></mrow></msubsup 
><mo class="qopname"> exp</mo><!--nolimits--> <mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><msup><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>u</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03BC;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow>
    <mrow 
><mn>2</mn><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac>     </mrow></mfenced> <mspace width="0em" class="thinspace"/><mi 
>d</mi><mi 
>u</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 313--><p class="nopar" > We are interested in
</p>
   <div class="math-display"><!--l. 314--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
             <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><munderover accentunder="false" accent="false"><mrow  
><mo mathsize="big" 
>&#x2211;</mo>
  </mrow><mrow 
><mi 
>i</mi><mo 
class="MathClass-rel">=</mo><mn>1</mn></mrow><mrow 
><mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn></mrow></munderover 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
>
<mi 
>i</mi></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>0</mn></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo>  <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn></mrow></msqrt><mi 
>&#x03C0;</mi><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac><msubsup><mrow 
><mo 
class="MathClass-op"> &#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x221E;</mi></mrow><mrow 
><mn>0</mn></mrow></msubsup 
><mo class="qopname"> exp</mo><!--nolimits--> <mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><msup><mrow 
><mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>u</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03BC;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow>
    <mrow 
><mn>2</mn><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
></mrow></mfrac>     </mrow></mfenced> <mspace width="0em" class="thinspace"/><mi 
>d</mi><mi 
>u</mi><mo 
class="MathClass-punc">.</mo>
</mrow></math></div>
<!--l. 318--><p class="nopar" > By the change of variables <!--l. 318--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>v</mi> <mo 
class="MathClass-rel">=</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mi 
>u</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>&#x03BC;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>&#x03C3;</mi></mrow></math>,
we can rewrite the probability as
</p>
                                                                          

                                                                          
   <div class="math-display"><!--l. 320--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="block" ><mrow 
>
            <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><!--mstyle 
class="text"--><mtext  >&#x00A0;annual</mtext><!--/mstyle--></mrow></msub 
> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>0</mn></mrow></mfenced> <mo 
class="MathClass-rel">=</mo>   <mfrac><mrow 
><mn>1</mn></mrow> 
<mrow 
><msqrt><mrow><mn>2</mn></mrow></msqrt><mi 
>&#x03C0;</mi></mrow></mfrac><msubsup><mrow 
><mo 
class="MathClass-op">&#x222B;
 <!--nolimits--></mo><!--nolimits--></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x221E;</mi></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BC;</mi><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>&#x03C3;</mi></mrow></msubsup 
><mo class="qopname"> exp</mo><!--nolimits--> <mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><msup><mrow 
><mi 
>v</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
><mo 
class="MathClass-bin">&#x2215;</mo><mn>2</mn></mrow></mfenced> <mspace width="0em" class="thinspace"/><mi 
>d</mi><mi 
>v</mi> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x03A6;</mi> <mfenced separators="" 
open="("  close=")" ><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mfrac><mrow 
><mi 
>&#x03BC;</mi></mrow>
<mrow 
><mi 
>&#x03C3;</mi></mrow></mfrac></mrow></mfenced>
</mrow></math></div>
<!--l. 324--><p class="nopar" > so that the probability depends only on the ratio
<!--l. 324--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BC;</mi><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>&#x03C3;</mi></mrow></math>. We desire
that <!--l. 325--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03A6;</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BC;</mi><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>&#x03C3;</mi></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-rel">=</mo> <mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><!--mstyle 
class="text"--><mtext  >&#x00A0;annual</mtext><!--/mstyle--></mrow></msub 
> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>0</mn></mrow></mfenced> <mn>1</mn><mo 
class="MathClass-bin">&#x2215;</mo><mn>1</mn><mn>0</mn><mo 
class="MathClass-punc">,</mo><mn>0</mn><mn>0</mn><mn>0</mn></mrow></math>. Then we
can solve for <!--l. 326--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mi 
>&#x03BC;</mi><mo 
class="MathClass-bin">&#x2215;</mo><mi 
>&#x03C3;</mi> <mo 
class="MathClass-rel">&#x2248;</mo><mo 
class="MathClass-bin">&#x2212;</mo><mn>3</mn><mo 
class="MathClass-punc">.</mo><mn>7</mn></mrow></math>.
Since <!--l. 327--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03BC;</mi> <mo 
class="MathClass-rel">=</mo> <mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced></mrow></math>
and <!--l. 327--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msup><mrow 
><mi 
>&#x03C3;</mi></mrow><mrow 
><mn>2</mn></mrow></msup 
> <mo 
class="MathClass-rel">=</mo> <mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn> <mo 
class="MathClass-bin">&#x22C5;</mo><mo class="qopname"> Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
>
<mn>1</mn></mrow></msub 
></mrow></mfenced></mrow></math>,
we calculate that for the total annual change to be a loss we must have
<!--l. 329--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x2248;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>3</mn><mo 
class="MathClass-punc">.</mo><mn>7</mn><mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mn>2</mn><mn>6</mn><mn>0</mn><mn>0</mn></mrow></msqrt></mrow><mo 
class="MathClass-close">)</mo></mrow> <mo 
class="MathClass-bin">&#x22C5;</mo><msqrt><mrow><mo class="qopname">Var</mo> <!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> </mrow></mfenced></mrow></msqrt> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>0</mn><mn>7</mn> <mo 
class="MathClass-bin">&#x22C5;</mo><msqrt><mrow><mo class="qopname">Var</mo> <!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> </mrow></mfenced></mrow></msqrt></mrow></math>.
</p><!--l. 332--><p class="indent" >   Now we consider what the requirement
<!--l. 332--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>0</mn><mn>7</mn> <mo 
class="MathClass-bin">&#x22C5;</mo><msqrt><mrow><mo class="qopname">Var</mo> <!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> </mrow></mfenced></mrow></msqrt></mrow></math>
means for specific distributions. If we assume that the individual changes
<!--l. 334--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></math>
are normally distributed with a positive mean, then we can use
<!--l. 335--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-bin">&#x2215;</mo><msqrt><mrow><mo class="qopname">Var</mo> <!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn> </mrow> </msub 
> </mrow></mfenced></mrow></msqrt> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>0</mn><mn>7</mn></mrow></math> to calculate
that <!--l. 335--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>0</mn> <mo 
class="MathClass-rel">&#x2248;</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>4</mn><mn>7</mn><mn>2</mn><mn>1</mn><mn>0</mn></mrow></math>, or
about <!--l. 336--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>4</mn><mn>7</mn><mi 
>%</mi></mrow></math>.
Alternatively, if we assume that the individual changes
<!--l. 337--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mi 
>i</mi></mrow></msub 
></mrow></math> are binomial random
variables with <!--l. 338--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
> <mo 
class="MathClass-rel">=</mo> <mn>1</mn></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mi 
>p</mi></mrow></math>,
then <!--l. 338--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>2</mn><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn></mrow></math> and
<!--l. 339--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mo class="qopname">Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>4</mn><mi 
>p</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math>. We can use
<!--l. 339--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mi 
>p</mi> <mo 
class="MathClass-bin">&#x2212;</mo> <mn>1</mn> <mo 
class="MathClass-rel">=</mo> <mi 
>E</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>0</mn><mn>7</mn><mo class="qopname"> Var</mo><!--nolimits--> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>0</mn><mn>7</mn> <mo 
class="MathClass-bin">&#x22C5;</mo> <mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>4</mn><mi 
>p</mi><mrow ><mo 
class="MathClass-open">(</mo><mrow><mn>1</mn> <mo 
class="MathClass-bin">&#x2212;</mo> <mi 
>p</mi></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow><mo 
class="MathClass-close">)</mo></mrow></mrow></math> to solve
for <!--l. 340--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi></mrow></math>. The
result is <!--l. 340--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>p</mi> <mo 
class="MathClass-rel">=</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>5</mn><mn>3</mn><mn>4</mn><mn>9</mn><mn>1</mn></mrow></math>.
</p><!--l. 343--><p class="indent" >   In either case, this means that any given piece of advice only has to have a
<!--l. 344--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>5</mn><mn>3</mn><mi 
>%</mi></mrow></math>
                                                                          

                                                                          
chance of being correct in order to have a perpetual money-making machine.
Compare this with the strategy of using a coin flip to provide the
advice. Since we don&#x2019;t observe any perpetual money-making machines,
we conclude that any advice about stock picking must be less than
<!--l. 348--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>5</mn><mn>3</mn><mi 
>%</mi></mrow></math>
reliable or about the same as flipping a coin.
</p><!--l. 351--><p class="indent" >   Now suppose that instead we have a computer algorithm predicting
stock movements for all publicly traded stocks, of which there are about
<!--l. 352--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mo 
class="MathClass-punc">,</mo><mn>0</mn><mn>0</mn><mn>0</mn></mrow></math>.
Suppose further that we wish to restrict the chance that
<!--l. 353--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><!--mstyle 
class="text"--><mtext  >&#x00A0;annual</mtext><!--/mstyle--></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>1</mn><msup><mrow 
><mn>0</mn></mrow><mrow 
><mo 
class="MathClass-bin">&#x2212;</mo><mn>6</mn></mrow></msup 
></mrow></math>,
that is 1 chance in a million. Then we can repeat the analysis
to show that the computer algorithm would only need to have
<!--l. 356--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x2119;</mi> <mfenced separators="" 
open="["  close="]" ><mrow><msub><mrow 
><mi 
>X</mi></mrow><mrow 
><mn>1</mn></mrow></msub 
></mrow></mfenced> <mo 
class="MathClass-rel">&#x003C;</mo> <mn>0</mn> <mo 
class="MathClass-rel">&#x2248;</mo> <mn>0</mn><mo 
class="MathClass-punc">.</mo><mn>4</mn><mn>9</mn><mn>7</mn><mn>3</mn><mn>7</mn></mrow></math>,
practically indistinguishable from a coin flip, in order to make money. This
provides a statistical argument against the utility of technical analysis for stock
price prediction. Money-making is not sufficient evidence to distinguish ability in
stock-picking from coin-flipping.
</p><!--l. 362--><p class="noindent" >
</p>
   <h4 class="likesubsectionHead"><a 
 id="x1-12000"></a>Sources</h4>
<!--l. 362--><p class="noindent" >This section is adapted from the article &#x201C;Tossing a Fair Coin&#x201D; by Leonard
Lipkin. The discussion of the continuity correction is adapted from <a 
href="http://www.math.uah.edu/stat/sample/CLT.xhtml" >Partial
Sums and the Central Limit Theorem</a>. in the Virtual Laboratories in
Probability and Statistics. The third example in this section is adapted from
a presentation by Jonathan Kaplan of D.E. Shaw and Co.&#x00A0;in summer
2010.
</p><!--l. 374--><p class="indent" >   _______________________________________________________________________________________________
</p><!--l. 376--><p class="noindent" >
</p>
   <h3 class="likesectionHead"><a 
 id="x1-13000"></a>Problems to Work for Understanding</h3>
<!--l. 377--><p class="noindent" >
                                                                          

                                                                          
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-13002x1">
           <ol  class="enumerate2" >
           <li 
  class="enumerate" id="x1-13004x1">What is the approximate probability that the number of heads is
           within <!--l. 382--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn></mrow></math>
           of the number of tails, that is, a difference of 2% or less of the
           number of tosses in 500 tosses?
           </li>
           <li 
  class="enumerate" id="x1-13006x2">What is the approximate probability that the number of heads is
           within <!--l. 387--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mn>0</mn></mrow></math>
           of the number of tails, that is, a difference of 4% or less of the
           number of tosses in 500 tosses?
           </li>
           <li 
  class="enumerate" id="x1-13008x3">What is the approximate probability that the number of heads is
           within <!--l. 392--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>2</mn><mn>5</mn></mrow></math>
           of the number of tails, that is, a difference of 5% or less of the
           number of tosses in 500 tosses?
           </li>
           <li 
  class="enumerate" id="x1-13010x4">Derive and then graph a simple power function that gives the
           approximate probability that the number of heads is within <!--l. 398--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>x</mi></mrow></math>
           of the number of tails in 500 tosses, for <!--l. 399--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>5</mn><mn>0</mn><mn>0</mn></mrow></math>.</li></ol>
      </li>
      <li 
  class="enumerate" id="x1-13012x2">
           <ol  class="enumerate2" >
           <li 
  class="enumerate" id="x1-13014x1">What is the probability that the number of heads is within <!--l. 405--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn></mrow></math>
           of the number of tails, that is, a difference of 1% or less of the
           number of tosses in 1000 tosses?
           </li>
           <li 
  class="enumerate" id="x1-13016x2">What is the probability that the number of heads is within <!--l. 410--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn></mrow></math>
           of the number of tails, that is, a difference of 0.5% or less of the
           number of tosses in 2000 tosses?
           </li>
           <li 
  class="enumerate" id="x1-13018x3">What is the probability that the number of heads is within <!--l. 415--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn><mn>0</mn></mrow></math>
           of the number of tails, that is, a difference of 0.2% or less of the
           number of tosses in 5000 tosses?
                                                                          

                                                                          
           </li>
           <li 
  class="enumerate" id="x1-13020x4">Derive and then graph a simple power function that gives the
           approximate probability that the number of heads is within <!--l. 421--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>x</mi></mrow></math>
           of the number of tails in 500 tosses, for <!--l. 422--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn> <mo 
class="MathClass-rel">&#x2264;</mo> <mi 
>x</mi> <mo 
class="MathClass-rel">&#x2264;</mo> <mn>5</mn><mn>0</mn><mn>0</mn></mrow></math>.</li></ol>
      </li>
      <li 
  class="enumerate" id="x1-13022x3">Derive the rate, as a function of
      <!--l. 425--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>,
      that the probability of heads exceeds tails by a fixed value
      <!--l. 426--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>s</mi></mrow></math> approaches
      <!--l. 426--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>1</mn></mrow></math> as
      <!--l. 427--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>.
      </li>
      <li 
  class="enumerate" id="x1-13024x4">Derive the rate, as a function of
      <!--l. 429--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi></mrow></math>,
      that the probability of heads exceeds tails by a fixed fraction
      <!--l. 430--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>&#x03F5;</mi></mrow></math> approaches
      <!--l. 431--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mn>0</mn></mrow></math> as
      <!--l. 431--><math 
 xmlns="http://www.w3.org/1998/Math/MathML" display="inline" ><mrow 
><mi 
>n</mi> <mo 
class="MathClass-rel">&#x2192;</mo><mi 
>&#x221E;</mi></mrow></math>.</li></ol>
<!--l. 434--><p class="noindent" >__________________________________________________________________________
</p><!--l. 436--><p class="noindent" >
</p>
   <h3 class="likesectionHead"><a 
 id="x1-14000"></a>Reading Suggestion:</h3>
<!--l. 1--><p class="noindent" >
</p>
   <h3 class="likesectionHead"><a 
 id="x1-15000"></a>References</h3>
<!--l. 1--><p class="noindent" >
   </p><div class="thebibliography">
   <p class="bibitem" ><span class="biblabel">
 [1]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
 id="Xfeller73"></a>William  Feller.    <span 
class="cmti-12">An  Introduction  to  Probability  Theory  and  Its</span>
                                                                          

                                                                          
   <span 
class="cmti-12">Applications, Volume I, Third Edition</span>, volume&#x00A0;I. John Wiley and Sons,
   third edition edition, 1973. QA 273 F3712.
   </p>
   <p class="bibitem" ><span class="biblabel">
 [2]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
 id="Xlesigne05"></a>Emmanuel  Lesigne.    <span 
class="cmti-12">Heads  or  Tails:  An  Introduction  to  Limit</span>
   <span 
class="cmti-12">Theorems in Probability</span>,  volume&#x00A0;28  of  <span 
class="cmti-12">Student Mathematical Library</span>.
   American Mathematical Society, 2005.
   </p>
   <p class="bibitem" ><span class="biblabel">
 [3]<span class="bibsp">&#x00A0;&#x00A0;&#x00A0;</span></span><a 
 id="Xlipkin03"></a>Leonard  Lipkin.   Tossing  a  fair  coin.   <span 
class="cmti-12">The  College  Mathematics</span>
   <span 
class="cmti-12">Journal</span>, 34(2):128&#x2013;133, March 2003.
</p>
   </div>
<!--l. 450--><p class="noindent" >__________________________________________________________________________
</p><!--l. 452--><p class="noindent" >
</p>
   <h3 class="likesectionHead"><a 
 id="x1-16000"></a>Outside Readings and Links:</h3>
<!--l. 453--><p class="noindent" >
      </p><ol  class="enumerate1" >
      <li 
  class="enumerate" id="x1-16002x1"><a 
href="http://www.math.uah.edu/stat/bernoulli/Walk.xhtml" >Virtual Laboratories in Probability and Statistics</a>.. Search the page for
      Random Walk Simulation and run the Last Visit to Zero experiment.
      </li>
      <li 
  class="enumerate" id="x1-16004x2"><a 
href="http://www.math.uah.edu/stat/bernoulli/Walk.xhtml" >Virtual Laboratories in Probability and Statistics</a>.. Search the page for
      Ballot Experiment and run the Ballot Experiment.</li></ol>
<!--l. 465--><p class="noindent" >__________________________________________________________________________
</p><!--l. 3--><p class="indent" >   <span 
class="cmr-10x-x-109">I check all the information on each page for correctness and typographical errors.</span>
<span 
class="cmr-10x-x-109">Nevertheless, some errors may occur and I would be grateful if you would alert me to</span>
<span 
class="cmr-10x-x-109">such errors. I make every reasonable effort to present current and accurate information</span>
<span 
class="cmr-10x-x-109">for public use, however I do not guarantee the accuracy or timeliness of information on</span>
<span 
class="cmr-10x-x-109">this website. Your use of the information from this website is strictly voluntary and at</span>
<span 
class="cmr-10x-x-109">your risk.</span>
                                                                          

                                                                          
</p><!--l. 12--><p class="indent" >   <span 
class="cmr-10x-x-109">I have checked the links to external sites for usefulness. Links to external websites</span>
<span 
class="cmr-10x-x-109">are provided as a convenience. I do not endorse, control, monitor, or guarantee the</span>
<span 
class="cmr-10x-x-109">information contained in any external website. I don&#x2019;t guarantee that the links are</span>
<span 
class="cmr-10x-x-109">active at all times. Use the links here with the same caution as you would all</span>
<span 
class="cmr-10x-x-109">information on the Internet. This website reflects the thoughts, interests and opinions of</span>
<span 
class="cmr-10x-x-109">its author. They do not explicitly represent official positions or policies of my</span>
<span 
class="cmr-10x-x-109">employer.</span>
</p><!--l. 22--><p class="indent" >   <span 
class="cmr-10x-x-109">Information on this website is subject to change without notice.</span>
</p><!--l. 2--><p class="indent" >   Steve Dunbar&#x2019;s Home Page, <span class="obeylines-h"><span class="verb"><span 
class="cmtt-12">http://www.math.unl.edu/~sdunbar1</span></span></span>
</p><!--l. 4--><p class="indent" >   Email to Steve Dunbar, <span class="obeylines-h"><span class="verb"><span 
class="cmtt-12">sdunbar1</span><span 
class="cmtt-12">&#x00A0;at</span><span 
class="cmtt-12">&#x00A0;unl</span><span 
class="cmtt-12">&#x00A0;dot</span><span 
class="cmtt-12">&#x00A0;edu</span></span></span>
</p><!--l. 469--><p class="indent" >   Last modified: Processed from <span class="LATEX">L<span class="A">A</span><span class="TEX">T<span 
class="E">E</span>X</span></span>&#x00A0;source on November 2, 2010
</p>
    
</body> 
</html> 

                                                                          



