Update README.md

Author: OssieLin

README.md

@@ -1,11 +1,11 @@
-# Comparative Analysis of Lucas-Type Sequence.
+# Comparative Analysis of Lucas-Type Sequence
 \
 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.\
 \
 Large random primes are constructed in practice by generating pseudorandom numbers and then doing a primality test such as the Fermat primality test or something more powerful such as the Miller–Rabin primality test.\
 These primality tests fail for certain numbers called **pseudoprimes**.\
-My research focuses on analyzing the class of Perrin-type primality tests- **Lucas-Type Sequence**: \
+My research focuses on analyzing the class of Perrin-type primality tests- **Lucas-Type Sequence**:\
 \
 ## Lucas-Type Sequence
 $$V_{n+2} = c_1 V_{n+1} + c_0 V_{n}, \quad V_{0} = 2, \quad V_{1} = c_1$$\