1. Mathematical Algorithms:

Euclidean Algorithm:

• Efficient method for computing the greatest common divisor (GCD) of two integers.

Sieve of Eratosthenes:

• Efficient algorithm for finding all prime numbers up to a specified integer.