Uploaded October 2012 | Updated November 2026, 3 hours ago
See complete series on recursion here
youtube.com/playlist?list=PL2_aWCzGMAwLz3g66WrxFGSXvSsvyfzCO
In this lesson, we will see an efficient recursive algorithm to calculate (x^n)%M - (x to power n modulo n)
Prerequisite: Basic knowledge of recursion in programming.
See complete series on recursion here
youtube.com/playlist?list=PL2_aWCzGMAwLz3g66WrxFGSXvSsvyfzCO
In this lesson, we will see an efficient recursive algorithm to calculate (x^n)%M - (x to power n modulo n)
Prerequisite: Basic knowledge of recursion in programming.










