...

/

Recursive factorial

Recursive factorial

We'll cover the following...

For positive values of nn, let's write n!n! as we did before, as a product of numbers starting from nn and going down to 1:n!=n(n1)211: n! = n⋅(n−1)⋯2⋅1. But notice that (n1)2(n−1)⋯211 is another way of writing (n1)!(n−1)!, and so we can say that n!=n(n1)!n! = n⋅(n−1)!. Did you see what we just did? We wrote n!n! as a product in ...