Modular Power

Easy Recursion Fundamentals

Log in to solve

Compute a^b mod m using fast exponentiation (recursion by halving the exponent).

Constraints

0 <= a, b <= 10^9 1 <= m <= 10^9

No discussions yet.