deletions | additions       diff --git a/untitled.tex b/untitled.tex  index d34cefa..57d23a9 100644  --- a/untitled.tex  +++ b/untitled.tex 
...
\end{itemize}  \smallskip  ANSWER: Since n=$77$, and it had to be composed of prime numbers p and q. p=$11$ and q=$7$. We know that e times x will give us $1$ times the mod of ((p-$1$)(q-$1$)). Next we compute s, ant and t  such that: \smallskip  $13$s+$60$t=$1$  \smallskip  Uing Euclidean ALgorithm we find s=$37$ and t=-$8$. That gives us d since d=s, so d=37.  Since we know n=p*q, we have n=$77$. I used a program to figure decode the numbers. I just set up the equation: \smallskip  (encrypted number)^s(mod n)