What do you obtain when calculating factorial recursively?

When calculating factorial recursively, the definition is based on the mathematical principle that the factorial of a number ( n ), denoted as ( n! ), is equal to ( n ) multiplied by the factorial of ( n-1 ). This can be expressed in recursive form as:

• ( n! = n \times (n-1)! ) for ( n > 0 )

• ( 0! = 1 ) as a base case.

This recursive formulation captures the essence of how factorials are built layer by layer, each layer relying on the previously calculated factorial until reaching the base case of 0. Therefore, when evaluating the factorial recursively, the correct interpretation aligns with the definition that the factorial is constructed as ( n ) multiplied by the factorial of ( n-1 ).