📄️ Euclidean Algorithm
Explanation and implementation of the Euclidean Algorithm to find the GCD of two numbers.
📄️ What is Mathematical Algorithms?
Mathematical Algorithms play a crucial role in solving complex problems efficiently in both DSA and competitive programming.
📄️ Importance of Mathematics
Mathematical algorithms are essential for solving various computational problems and are widely used in both theoretical computer science and practical applications. They underpin many algorithms used in competitive programming and other fields.
📄️ Sieve of Eratosthenes
The Sieve of Eratosthenes is an efficient algorithm to find all prime numbers up to a given limit.
📄️ GCD and LCM
Greatest Common Divisor (GCD) and Least Common Multiple (LCM) are fundamental algorithms for divisibility.
📄️ Fermat's Little Theorem MMI
A comprehensive guide to calculating the modular multiplicative inverse using Fermat's Little Theorem.
📄️ Discrete Logarithm Problem
An overview of the Discrete Logarithm problem and its applications in cryptography.
📄️ Sweep Line Algorithm
A comprehensive guide to understanding and implementing the sweep line algorithm for computational geometry.
📄 ️ Modular Arithmetic
Modular arithmetic is a fundamental concept in mathematics, essential for cryptography and number theory.