"The binary method for finding an is as follows:
1) If n is 1 then a1 is a.
Otherwise:
2) If n is even, find an/2 recursively and return the square of the result.
3) Finally, if n is odd, bigger than 1, then n-1 is even and we can compute a(n-1)/2 recursively, square the result and multiply this result by a. This is the value returned by the function in this case.
Note that calling a**n is not a recursive call. You have to call the same function you are defining."
Could someone please help me!
