Merge pull request #1889 from madeline-underwood/patch-18

Minor change to itemized list so only two points are listed for two checksums

Author: jasonrandrews

content/learning-paths/cross-platform/adler32/about-2.md

@@ -36,7 +36,8 @@ The algorithm works by calculating two 16-bit sums:
 
 - s1: A simple sum of all bytes.
 - s2: A sum of all s1 values after each byte.
-- The final checksum is `(s2 << 16) | s1`.
+
+The final checksum is `(s2 << 16) | s1`.
 
 ## What You'll Build
 
@@ -49,4 +50,4 @@ This project walks you through building the following components using GitHub Co
 - A NEON-optimized version of Adler32.
 - A performance comparison table for both implementations.
 
-Continue to the next section to start creating the project.
+Continue to the next section to start creating the project.