Question: Devise a recursive algorithm for finding x^n mod m , whenever x , n and m are positive integers based on the fact that x^n
Devise a recursive algorithm for finding x^n mod m , whenever x , n and m are positive integers based on the fact that x^n mod m =(x^n-1 mod m*x mod m)mod m. Can you please create this method in java?
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
