OssieLin
diff --git a/‎README.md‎
Lines changed: 1 addition & 1 deletion b/‎README.md‎
Lines changed: 1 addition & 1 deletion
@@ -1,4 +1,4 @@
-#h1 This project is the comparative analysis of primality testing algorithms.\
+# This project is the comparative analysis of primality testing algorithms.\
 \
 Modern cryptography algorithms like RSA need primality tests to generate large random primes.\
 Specifically, RSA uses the product of two prime numbers to generate the public and private keys; if these primes are predictable, it makes it easier for an attacker to break the encryption scheme.\
Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-#h1 This project is the comparative analysis of primality testing algorithms.\`
	`1`	`+# This project is the comparative analysis of primality testing algorithms.\`
`2`	`2`	`\`
`3`	`3`	`Modern cryptography algorithms like RSA need primality tests to generate large random primes.\`
`4`	`4`	`Specifically, RSA uses the product of two prime numbers to generate the public and private keys; if these primes are predictable, it makes it easier for an attacker to break the encryption scheme.\`