diff --git a/README.md b/README.md
index dab81e8..2158fdd 100644
--- a/README.md
+++ b/README.md
@@ -58,12 +58,12 @@ CFcSBwgCCBoHRhkKU1cGAA4AGU5YQR5THBwNFwoGGAxTQQMQVBUSBg4EAAwQRhUQVBUHFAQTGRpT QQM
 * Completed in: 1 day, 23 hrs, 21 secs.
 * Check Loop Proof
   1. (ac, bc) => (2ac, bc-ac) = (a, b) => (2a, b-a)
-    * a < b
+     * a < b
   1. (ac, bc+d) => (2ac, bc+d-ac) = (2ac, (b-a)c+d)
-    * a < b and 0 < d < c
+     * a < b and 0 < d < c
   1. (a, 2n-a) => (2a, 2n-2a) = (a, n-a)
-    * a < n
+     * a < n
   1. (x, y) will loop iff (x + y) % 2 == 1
-    * x and y are relative prime number
+     * x and y are relatively prime
 * Reference
   * [Maximum Matching in General Graph](https://www.secmem.org/blog/2020/04/18/Blossom/)