Given three numbers x, y and p, compute (xy) % p.
Input: x = 2, y = 3, p = 5 Output: 3 Explanation: 2^3 % 5 = 8 % 5 = 3. Input: x = 2, y = 5, p = 13 Output: 6 Explanation: 2^5 % 13 = 32 % 13 = 6.
Below is discussed iterative solution.
The problem with above solutions is, overflow may occur for large value of n or x. Therefore, power is generally evaluated under modulo of a large number.
Below is the fundamental modular property that is used for efficiently computing power under modular arithmetic.
(ab) mod p = ( (a mod p) (b mod p) ) mod p For example a = 50, b = 100, p = 13 50 mod 13 = 11 100 mod 13 = 9 (50 * 100) mod 13 = ( (50 mod 13) * (100 mod 13) ) mod 13 or (5000) mod 13 = ( 11 * 9 ) mod 13 or 8 = 8
Below is the implementation based on above property.
Power is 6
Time Complexity of above solution is O(Log y).
Modular exponentiation (Recursive)
This article is contributed by Shivam Agrawal. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
- Modular exponentiation (Recursive)
- Modular multiplicative inverse
- Write an iterative O(Log y) function for pow(x, y)
- Write a program to calculate pow(x,n)
- Program for Fibonacci numbers
- Dynamic Programming vs Divide-and-Conquer
- Cut all the rods with some length such that the sum of cut-off length is maximized
- Find the Missing Number in a sorted array
- First strictly smaller element in a sorted array in Java
- First strictly greater element in a sorted array in Java