Description:
Implement Modular Exponentiation, a key algorithm used in number theory and cryptography:
Efficiently compute (a^b) mod m using binary exponentiation
Should handle large values of a, b, and m (up to 10^18)
Include a clean explanation and usage example in comments or a README.md
📁 Example Path: math/modular-exponentiation/modular-exponentiation.cpp (or .py, .js, etc.)
📘 Difficulty: Intermediate
📦 Bonus: Optional command-line interface to accept values from the user
Description:
Implement Modular Exponentiation, a key algorithm used in number theory and cryptography:
📁 Example Path: math/modular-exponentiation/modular-exponentiation.cpp (or .py, .js, etc.)
📘 Difficulty: Intermediate
📦 Bonus: Optional command-line interface to accept values from the user