1. Lowest prime Factor(LPF) of a Number using O(nloglogn): https://github.com/MehrajShakil/Mathematics/blob/master/Sieve/LPF%20using%20O(nloglogn).cpp
2. lcm of first n natural numbers up to 10^6: https://github.com/MehrajShakil/Mathematics/blob/master/gcd%20and%20lcm/lcm%20of%20first%20n%20natural%20numbers%20up%20to%2010%5E6%20.cpp
3. segmented Sieve: https://github.com/MehrajShakil/Mathematics/blob/master/Sieve/segmented%20Sieve.cpp
3. Combinatorics Template: https://github.com/MehrajShakil/Mathematics/blob/master/Modular%20Inverse/Tamplet.cpp
4. Extended_euclidean_Implementation: https://github.com/MehrajShakil/Mathematics/blob/master/Extend
5. Euler totient function from 1 to n in O(nloglogn): https://github.com/MehrajShakil/Mathematics/blob/master/Euler's%20totient%20function/Euler%20totient%20function%20from%201%20to%20n%20in%20O(nloglogn).cpp
6. Sigma_Function: https://github.com/MehrajShakil/Mathematics/blob/master/Count%20Divisors/Sigma_Function.cpp
7. sod of first n natural numbers: https://github.com/MehrajShakil/problem-solve-from-Morass-blog/blob/master/Divisors/INVDIV%20-%20Smallest%20Inverse%20Sum%20of%20Divisors.cpp