The factorial of an integer is the product of that integer multiplied by all the positive non-zero integers less than that integer. So, 5! ! is the mathematical symbol for factorial) is 5 * 4 * 3*2*1. 4! is 4*3*2*1, so 5! could be written as 5*4!. So a recursive definition of factorial is n! is n*n-1)!, as long as n 1. 1! is 1. What is the stopping case for this function? A) n

Question

The factorial of an integer is the product of that integer multiplied by all the positive non-zero integers less than that integer. So, 5! ! is the mathematical symbol for factorial) is 5 * 4 * 3*2*1. 4! is 4*3*2*1, so 5! could be written as 5*4!. So a recursive definition of factorial is n! is n*n-1)!, as long as n >1. 1! is 1. What is the stopping case for this function?
A) n<1
B) n==0
C) n==1
D) none of the above

Quizplus · Accepted Answer

The stopping case for the recursive definition of factorial is when n equals 1. This is because the factorial of 1 is defined to be 1, and n! is defined as n * (n-1)!, which means that eventually, the recursion will reach 1! as a stopping point.

The Factorial of an Integer Is the Product of That