Question: GIVEN THE INTEGERS B, n and M as inputs, design an algorithm to compute the value of (B^n mod M) in O(log n) time in
GIVEN THE INTEGERS B, n and M as inputs, design an algorithm to compute the value of (B^n mod M) in O(log n) time in the worst case. Note that B^(p+q) mod M = ((B^p mod M) (B^q mod M)) mod M. Lets assume n = 2^k for an integer k for simplicity.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
