# A little bit of number theory

• (3/16/2017, AVP) At the author's suggestion, Anthony Pulido worked through theorem 2 for $p = 3 \equiv 3 \pmod{4}$ and $p = 5 \equiv 1 \pmod{4}$. This is the note titled Examples. This exercise led to writing a short Haskell program, lbnt.hs, which verifies theorem 2 for the first 100 odd primes.