Solution for Problem Euler 56
diff --git a/project_euler/problem_56/__init__.py b/project_euler/problem_56/__init__.py
new file mode 100644
index 000000000000..e69de29bb2d1
diff --git a/project_euler/problem_56/sol1.py b/project_euler/problem_56/sol1.py
new file mode 100644
index 000000000000..194a7a37af43
--- /dev/null
+++ b/project_euler/problem_56/sol1.py
@@ -0,0 +1,26 @@
+
+
+def maximum_digital_sum(a: int, b: int) -> int:
+    """
+        Considering natural numbers of the form, a**b, where a, b < 100,
+        what is the maximum digital sum?
+        :param a:
+        :param b:
+        :return:
+        >>> maximum_digital_sum(10,10)
+        45
+
+        >>> maximum_digital_sum(100,100)
+        972
+
+        >>> maximum_digital_sum(100,200)
+        1872
+    """
+
+    # RETURN the MAXIMUM from the list of SUMs of the list of INT converted from STR of BASE raised to the POWER
+    return max([sum([int(x) for x in str(base**power)]) for base in range(a) for power in range(b)])
+
+#Tests
+if __name__ == "__main__":
+    import doctest
+    doctest.testmod()

Solution for problem Euler 56