From c8a5568fd09433e042fc4fe0c1e7db252bf3ac48 Mon Sep 17 00:00:00 2001
From: Suad Djelili <suadjelili@gmail.com>
Date: Sun, 27 Oct 2019 20:43:33 +0300
Subject: [PATCH 1/2] added solution 4 for problem_20

---
 project_euler/problem_20/sol4.py | 40 ++++++++++++++++++++++++++++++++
 1 file changed, 40 insertions(+)
 create mode 100644 project_euler/problem_20/sol4.py

diff --git a/project_euler/problem_20/sol4.py b/project_euler/problem_20/sol4.py
new file mode 100644
index 000000000000..50ebca5a0bf7
--- /dev/null
+++ b/project_euler/problem_20/sol4.py
@@ -0,0 +1,40 @@
+"""
+n! means n × (n − 1) × ... × 3 × 2 × 1
+
+For example, 10! = 10 × 9 × ... × 3 × 2 × 1 = 3628800,
+and the sum of the digits in the number 10! is 3 + 6 + 2 + 8 + 8 + 0 + 0 = 27.
+
+Find the sum of the digits in the number 100!
+"""
+
+
+def solution(n):
+    """Returns the sum of the digits in the number 100!
+    >>> solution(100)
+    648
+    >>> solution(50)
+    216
+    >>> solution(10)
+    27
+    >>> solution(5)
+    3
+    >>> solution(3)
+    6
+    >>> solution(2)
+    2
+    >>> solution(1)
+    1
+    """
+    fact = 1
+    result = 0
+    for i in range(1,n + 1):
+        fact *= i
+
+    for j in str(fact):
+        result += int(j)
+
+    return result
+
+
+if __name__ == "__main__":
+    print(solution(int(input("Enter the Number: ").strip())))

From 9f7acb8dec77656150b958f9785a32f929d483d3 Mon Sep 17 00:00:00 2001
From: Suad Djelili <suadjelili@gmail.com>
Date: Mon, 28 Oct 2019 02:14:32 +0300
Subject: [PATCH 2/2] added solution 3 for problem_25

---
 project_euler/problem_25/sol3.py | 57 ++++++++++++++++++++++++++++++++
 1 file changed, 57 insertions(+)
 create mode 100644 project_euler/problem_25/sol3.py

diff --git a/project_euler/problem_25/sol3.py b/project_euler/problem_25/sol3.py
new file mode 100644
index 000000000000..4e3084ce5456
--- /dev/null
+++ b/project_euler/problem_25/sol3.py
@@ -0,0 +1,57 @@
+# -*- coding: utf-8 -*-
+"""
+The Fibonacci sequence is defined by the recurrence relation:
+
+    Fn = Fn−1 + Fn−2, where F1 = 1 and F2 = 1.
+
+Hence the first 12 terms will be:
+
+    F1 = 1
+    F2 = 1
+    F3 = 2
+    F4 = 3
+    F5 = 5
+    F6 = 8
+    F7 = 13
+    F8 = 21
+    F9 = 34
+    F10 = 55
+    F11 = 89
+    F12 = 144
+
+The 12th term, F12, is the first term to contain three digits.
+
+What is the index of the first term in the Fibonacci sequence to contain 1000
+digits?
+"""
+
+
+def solution(n):
+    """Returns the index of the first term in the Fibonacci sequence to contain
+    n digits.
+
+    >>> solution(1000)
+    4782
+    >>> solution(100)
+    476
+    >>> solution(50)
+    237
+    >>> solution(3)
+    12
+    """
+    f1, f2 = 1, 1
+    index = 2
+    while True:
+        i = 0
+        f = f1 + f2
+        f1, f2 = f2, f
+        index += 1
+        for j in str(f):
+            i += 1
+        if i == n:
+            break
+    return index
+
+
+if __name__ == "__main__":
+    print(solution(int(str(input()).strip())))