Update sol1.py

Author: MaximSmolskiy

project_euler/problem_190/sol1.py

@@ -5,20 +5,18 @@
 
 Let S_m = (x_1, x_2, ..., x_m) be the m-tuple of positive real numbers with
 x_1 + x_2 + ... + x_m = m for which P_m = x_1 * x_2^2 * ... * x_m^m is maximised.
-For example, it can be verified that |_P_10_| = 4112
-(|__| is the integer part function).
-Find Sum_{m=2}^15 = |_P_m_|.
+
+For example, it can be verified that |_ P_10 _| = 4112
+(|_ _| is the integer part function).
+
+Find Sum_{m=2}^15 = |_ P_m _|.
 
 Solution:
 - Fix x_1 = m - x_2 - ... - x_m.
 - Calculate partial derivatives of P_m wrt the x_2, ..., x_m. This gives that
   x_2 = 2 * x_1, x_3 = 3 * x_1, ..., x_m = m * x_1.
 - Calculate partial second order derivatives of P_m wrt the x_2, ..., x_m.
   By plugging in the values from the previous step, can verify that solution is maximum.
-
->>> solution(5)
-10
-
 """
 
 
@@ -32,7 +30,8 @@ def solution(n: int = 15) -> int:
     2
     >>> solution(4)
     4
-
+    >>> solution(5)
+    10
     """
 
     ans = 0