# powerN challenge

Hi,

I am working on below challenge
http://codingbat.com/prob/p158888

Given base and n that are both 1 or more, compute recursively (no loops) the value of base to the n power, so powerN(3, 2) is 9 (3 squared).

powerN(3, 1) → 3
powerN(3, 2) → 9
powerN(3, 3) → 27
i was not clear on how to find the powerN using recursion? please advise
LVL 7
###### Who is Participating?

Commented:
This challenge is very similar to the other challenges that you started to the same time. I can give you two hints about the base case here.  Every number to the power of 0 is equal to one.  Furthermore, every number multiplied by 1 is equal to that same number.
0

Author Commented:
``````public int powerN(int base, int n) {
if(n==0) return 1;
//  if(n==1) return base;
else{
return base*powerN(base,n-1);
}
}
``````
above passes all test. any alternate approaches or improvements?
0

Commented:
My solution is the same as yours.
0
Question has a verified solution.

Are you are experiencing a similar issue? Get a personalized answer when you ask a related question.

Have a better answer? Share it in a comment.