Factorial Series 11-19-2012, 05:03 AM
#1
Hey guy, do you know how to make a recursive function that work like this:
we input a value n the function will return the sum of the factorial like this: 1! +2! + .... + (n-1)! + n!
without using loop, only recursive.
we input a value n the function will return the sum of the factorial like this: 1! +2! + .... + (n-1)! + n!
without using loop, only recursive.
![[+]](https://sinister.li/images/modern/collapse_collapsed.png)
