How can i make a recursive formula to calculate the factorial of number?

Step-by-step explanation:

n! = n.(n - 1).(n - 2).(n - 3). ... .(n - p)!

p is a natural number.

I hope I've helped you.

Let's do it by applying the formula. We defined 0! to ... Computing powers of a number ... If a programmer who worked for me used recursion to compute a factorial, I'd hire someone else.

Step-by-step explanation:

hope this helps you

❤ ❤ ❤ ❤ ❤ ❤

use the power rule  

( a b ) n = a n b n

to distribute the exponent.

apply the product rule to  

3 x 2 y 3 . ( 3 x 2 ) 2 ( y 3 ) 2

apply the product rule to  

3 x 2 . 3 2 ( x 2 ) 2 ( y 3 ) 2

raise  

3

to the power of  

2 . 9 ( x 2 ) 2 ( y 3 ) 2 multiply the exponents in   ( x 2 ) 2

.

apply the power rule and multiply exponents,  

( a m ) n = a m n . 9 x 2 ⋅ 2 ( y 3 ) 2

multiply  

2   by   2 . 9 x 4 ( y 3 ) 2

multiply the exponents in  

( y 3 ) 2 .

apply the power rule and multiply exponents,  

( a m ) n = a m n . 9 x 4 y 3

⋅

2

multiply  

3   by   2 . 9 x 4 y 6

step-by-step explanation: