Does anybody know how I can solve this problem, at this point I am just looking for answers, I'm stressed and just want to complete this assignment, if you do know and can provide me with the proper code to solve it, I would greatly appreciate it, thank you.
No, that is not what they want. They want a recursive solution for x^x = N. To be able to solve this for higher values of x, you might take the logs of both sides. How would you turn Newton-Raphson or a binary search into a recursive one?
There are three kinds of actuaries: those who can count, and those who can't.