Update README.md

Author: OmarBazaraa

README.md

@@ -76,15 +76,15 @@ A brief explanation to each of the following topics will be added soon, hopefull
 
 ### Math
 - [Basic Discrete Math & Modular Arithmetics](https://github.com/OmarBazaraa/Competitive-Programming/tree/master/math)
-- [Greatest Common Divisor (GCD)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L8)
-- [Least Common Multiple (LCM)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L27)
-- [Bézout's Coefficients (using extended Euclid's method)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L33)
-- [Fast Power](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L50)
-- [Modular Inverse](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L80)
-- [Combinations (nCr)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L88)
-- [Pascal Triangle](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L103)
-- [Check Integer Primality](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L149)
-- [Check Integer Primality using Miller Rabin](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L113)
+- [Greatest Common Divisor (GCD)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L13)
+- [Least Common Multiple (LCM)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L31)
+- [Bézout's Coefficients (using extended Euclid's method)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L39)
+- [Fast Power](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L55)
+- [Modular Inverse](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L85)
+- [Combinations (nCr)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L94)
+- [Pascal Triangle](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L108)
+- [Check Integer Primality](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L116)
+- [Check Integer Primality using Miller Rabin](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L149)
 - [Generate Prime Numbers (using Sieve of Eratosthenes' algorithm)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L181)
 - [Generate Divisors (single/bulk operation)](https://github.com/OmarBazaraa/Competitive-Programming/blob/master/math/math.cpp#L198)
 - All divisors