Fix

Author: MaximSmolskiy

project_euler/problem_058/sol1.py

@@ -51,7 +51,7 @@ def isprime(n: int) -> int:
     if n % 2 == 0 and n > 2:
         return 0
 
-    i = 2
+    i = 3
     while i * i <= n:
         if n % i == 0:
             return 0