We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
1 parent 9104cb8 commit 739332fCopy full SHA for 739332f
maths/sum_of_factorial.py
@@ -31,6 +31,7 @@ def sum_of_factorial_circle_plus_recursion(number: int) -> int:
31
"""
32
sum_factorial = 0
33
from math import factorial
34
+
35
for i in range(1, number + 1):
36
sum_factorial += factorial(i)
37
return sum_factorial
@@ -52,8 +53,14 @@ def sum_of_factorial_pure_recursion(number: int) -> int:
52
53
elif number == 2:
54
return 3 # 1! + 2!
55
else:
- return sum_of_factorial_pure_recursion(number - 1) + (
56
- sum_of_factorial_pure_recursion(number - 1) - sum_of_factorial_pure_recursion(number - 2)) * number
+ return (
57
+ sum_of_factorial_pure_recursion(number - 1)
58
+ + (
59
60
+ - sum_of_factorial_pure_recursion(number - 2)
61
+ )
62
+ * number
63
64
65
66
if __name__ == "__main__":
0 commit comments