[quote=@Multifarious]
[@Legend]

How should I go about recursively writing a method that raises x to a power of n and works for both +n and -n? Powers are easy enough but I don't see the logic behind getting it to work for both
[/quote]

Not sure why anyone wouldn't use the built in x^5, but you could do something like


public int powerUp(int num, int power)
{
	if(power == 0)			//Stop condition
		return 1;
	else if (power > 0)		//Positive powers
		return powerUp(num, power - 1) * num;
	else				//Negative powers
		return 1 / powerUp(num, power + 1) * num;
}