The discrete logarithm finds a solution for $x$ in the congruence $a^x \equiv b \pmod{n}$ where $a$, $b$, and $n$ are **integers**, $a$ and $n$ are coprime. This article covers two algorithms to solve this problem: by trial multiplication and using Baby Step Giant Step.