Update README.md

README.md

@@ -53,6 +53,7 @@ In all cases the characters are heavily concentrated around 0 with very long tai
 |----------|----------|
 | Train | 118,580 |
 | Test  | 29,645 |
+
 Maximum character value 16,336,320, minimum character value -1,223,040.
 
 **Characters of \\(S_{20}\\)**
@@ -60,6 +61,7 @@ Maximum character value 16,336,320, minimum character value -1,223,040.
 |----------|----------|
 | Train | 298,661 |
 | Test  | 74,819 |
+
 Maximum character value 249,420,600, minimum character value -17,592,960.
 
 **Characters of \\(S_{22}\\)**
@@ -67,6 +69,7 @@ Maximum character value 249,420,600, minimum character value -17,592,960.
 |----------|----------|
 | Train | 763,109 |
 | Test  | 190,726 |
+
 Maximum character value 5,462,865,408, minimum character value -279,734,796.
 
 **Math question (solved):** The [Murnaghan–Nakayama rule](https://en.wikipedia.org/wiki/Murnaghan–Nakayama_rule) is an example of an algorithm for calculating the character of an irreducible representation of the symmetric group using only elementary operations on the corresponding pair of partitions.