So, this question has been giving me a little bit of trouble. It's supposed to be just a few lines, and I know that I don't need to write out the base case, recursive step, and restriction. I understand the concept as well, but I'm not sure how to prove it correctly. Basically, I have written out about 6 steps with both equations (a_n = n^n-1 and a_k+1 = 5a_k). I don't know if this is technically the proper way to prove it though. Any help would be appreciated!