  A sequence of geometric random variables of length $n$ is a sequence of $n$
independent and identically distributed geometric random variables ($\Gamma_1,
\Gamma_2, \dots, \Gamma_n$) where $\mathbb{P}(\Gamma_j=i)=pq^{i-1}$ for
$1~\leq~j~\leq~n$ with $p+q=1.$ We study the number of distinct adjacent two
letter patterns in such sequences. Initially we directly count the number of
distinct pairs in words of short length. Because of the rapid growth of the
number of word patterns we change our approach to this problem by obtaining an
expression for the expected number of distinct pairs in words of length $n$. We
also obtain the asymptotics for the expected number as $n \to \infty$.
