deletions | additions       diff --git a/Math.tex b/Math.tex  index ecb2e82..ce65fc2 100644  --- a/Math.tex  +++ b/Math.tex 
...
ω=(ω_0, ω_1, ..., ω_n)  \end{equation}  In this case, $ω_j ∈ {\Bbb R}$, $ω_0=x$, $|ω_j − ω_{j−1}| = 1$, $j = 1, 2, . . . , n$, $ω_i \neq ω_j$ for $i \neq j$, and $0 ≤ i < j ≤ n$. In other words, no new movement (each of which is a length of 1 in a discrete direction the real plane) can occur such that the path coincides with itself in two distinct events.  The equation defines at which position the path will lie after $n$ number of steps.  \hspace{2000 mm} To model the distribution of $S_{n}$ we need to set it to $x$ and set the number of steps to the right and left by $r$ and $l$, respectively. Given this, $x = r - l$ and $n$, the total number of steps actually executed, $= r + l$. By simply solving for $r$ and $l$ we deduce that $r = (1/2)(x+n)$ and $l = (1/2)(n-x)$.