14 docs tagged with "number theory"

An algorithm to compute the total number of divisors of a given integer n.

An overview of the Discrete Logarithm problem and its applications in cryptography.

A detailed guide to understanding and implementing the Divisibility and Prime Numbers.

Explanation and implementation of the Euclidean Algorithm to find the GCD of two numbers.

A comprehensive guide to calculating the modular multiplicative inverse using Fermat's Little Theorem.

A detailed guide to understanding and implementing the GCD (Greatest Common Divisor) Algorithm in Number Theory.

Greatest Common Divisor (GCD) and Least Common Multiple (LCM) are fundamental algorithms for divisibility.

A detailed guide to understanding and implementing the LCM (Least Common Multiple) Algorithm in Number Theory.

Modular arithmetic is a fundamental concept in mathematics, essential for cryptography and number theory.

A detailed guide to understanding and implementing the Modular Arithmetic in Number Theory.

A comprehensive guide on Modular Exponentiation for fast computation of large powers in modular arithmetic.

Modular Exponentiation is an algorithm used to efficiently compute large powers modulo a number, using a technique called exponentiation by squaring.

The Sieve of Eratosthenes is an efficient algorithm to find all prime numbers up to a given limit.

A complete guide to understanding and implementing the Sieve of Eratosthenes for finding prime numbers.