feat(algorithms): Add Algorithmic Math Problems module

[basantnema31]

Closes #2254

This PR adds a new curriculum module for classical Algorithmic Math Problems to the algorithms/ directory, following the standard formatting and structure of the curriculum.

Key additions include:

• Foundational Concepts: Why mathematical algorithms are important in computer science (e.g., cryptography).
• Primality Testing: Naive approach vs optimized approach (checking up to the square root of n).
• Sieve of Eratosthenes: Highly efficient algorithm for generating all primes up to a limit.
• Euclidean Algorithm: Recursive and iterative approaches for finding the Greatest Common Divisor (GCD).

Structure:

• Interactive Visual Walkthroughs using <details> blocks for each algorithm.
• JavaScript implementations for each algorithm.
• Guided Practice (LCM calculation using GCD).
• Independent Practice (Sum of Primes, Coprime checking).
• Check for Understanding conceptual questions.
• Links to external resources and visualizations (VisuAlgo, CP-Algorithms).