diff --git a/readme.md b/readme.md
index cb357ec..638e7c0 100644
--- a/readme.md
+++ b/readme.md
@@ -1,8 +1,9 @@
 # Quadratic Sieve Factorization
 
-Guides:
-* Detailed Guide on QS: https://medium.com/nerd-for-tech/heres-how-quadratic-sieve-factorization-works-1c878bc94f81
-* Wikipedia Article: https://en.wikipedia.org/wiki/Quadratic_sieve
-* Euler's Criterion for pre-emptevely determining if $ \exists a \text{such that } a^2 \equiv n \mod{p} $: https://en.wikipedia.org/wiki/Euler%27s_criterion
-* Tonelli shanks for finding quadratic residues (and Tonelli equation): https://en.wikipedia.org/w/index.php?title=Tonelli%E2%80%93Shanks_algorithm&oldid=1014170710#Tonelli%27s_algorithm_will_work_on_mod_p%5Ek
-* Block Wiedemann wikipedia article for computing the nullspace of a matrix (not implemented): https://en.wikipedia.org/wiki/Block_Wiedemann_algorithm
+**Guides:**
+
+- [Detailed Guide on QS](https://medium.com/nerd-for-tech/heres-how-quadratic-sieve-factorization-works-1c878bc94f81)
+- [Wikipedia Article](https://en.wikipedia.org/wiki/Quadratic_sieve)
+- [Euler's Criterion for preemptively determining if $\exists a$ such that $a^2 \equiv n \mod{p}$](https://en.wikipedia.org/wiki/Euler%27s_criterion)
+- [Tonelli-Shanks for finding quadratic residues (and Tonelli equation)](https://en.wikipedia.org/w/index.php?title=Tonelli%E2%80%93Shanks_algorithm&oldid=1014170710#Tonelli%27s_algorithm_will_work_on_mod_p%5Ek)
+- [Block Wiedemann Wikipedia Article for computing the nullspace of a matrix (not implemented)](https://en.wikipedia.org/wiki/Block_Wiedemann_algorithm)