- #1
neik
- 15
- 0
Devise a recursive algorithm for finding [tex]x^n \bmod m[/tex] whenever n, x, and m are positive integers, based on the fact that
[tex]x^n \bmod m = (x^{n-1} \bmod m \cdot x \bmod m) \bmod m[/tex]
can anyone give me some hints? i don't know where to start
thank you
[tex]x^n \bmod m = (x^{n-1} \bmod m \cdot x \bmod m) \bmod m[/tex]
can anyone give me some hints? i don't know where to start
thank you
Last edited: