• Fn (n) = expression relating to Fn (n - 1)
• Write method named Fn receiving n as a paramter and returning correct type
• Place code in the method that is the expression relating to Fn (n - 1)

• Place an if statement that checks for the stopping condition in the method
• If the condition is true return the base value
• Otherwise, make the recursive call. (Expression relating to FN(n - 1)
• Consider summation

function Factorial(num)
{
    if (num == 0) 
	return 1;
    else 
	return num * Factorial( num - 1 );
}