Improve Project Euler problem 058 solution 1
diff --git a/project_euler/problem_058/sol1.py b/project_euler/problem_058/sol1.py
index d3b15157fbbd..ed407edf7158 100644
--- a/project_euler/problem_058/sol1.py
+++ b/project_euler/problem_058/sol1.py
@@ -33,11 +33,12 @@
 count of current primes.
 
 """
+from math import isqrt
 
 
-def isprime(d: int) -> int:
+def isprime(number: int) -> int:
     """
-    returns whether the given digit is prime or not
+    returns whether the given number is prime or not
     >>> isprime(1)
     0
     >>> isprime(17)
@@ -45,14 +46,15 @@ def isprime(d: int) -> int:
     >>> isprime(10000)
     0
     """
-    if d == 1:
+    if number == 1:
         return 0
 
-    i = 2
-    while i * i <= d:
-        if d % i == 0:
+    if number % 2 == 0 and number > 2:
+        return 0
+
+    for i in range(3, isqrt(number) + 1, 2):
+        if number % i == 0:
             return 0
-        i = i + 1
     return 1
 
 

### **Describe your change:**
Improve Project Euler problem 058 solution 1 - the top 7 slowest solution on Travis CI logs (under `slowest 10 durations`: `11.38s call     scripts/validate_solutions.py::test_project_euler[problem_058/sol1.py]`):
* Fix typo
* Improve solution (locally 4+ times - from 8+ seconds to ~2 seconds)

* [ ] Add an algorithm?
* [x] Fix a bug or typo in an existing algorithm?
* [ ] Documentation change?

### **Checklist:**
* [x] I have read [CONTRIBUTING.md](https://github.com/TheAlgorithms/Python/blob/master/CONTRIBUTING.md).
* [x] This pull request is all my own work -- I have not plagiarized.
* [x] I know that pull requests will not be merged if they fail the automated tests.
* [x] This PR only changes one algorithm file.  To ease review, please open separate PRs for separate algorithms.
* [x] All new Python files are placed inside an existing directory.
* [x] All filenames are in all lowercase characters with no spaces or dashes.
* [x] All functions and variable names follow Python naming conventions.
* [x] All function parameters and return values are annotated with Python [type hints](https://docs.python.org/3/library/typing.html).
* [x] All functions have [doctests](https://docs.python.org/3/library/doctest.html) that pass the automated testing.
* [x] All new algorithms have a URL in its comments that points to Wikipedia or other similar explanation.
* [x] If this pull request resolves one or more open issues then the commit message contains `Fixes: #{$ISSUE_NO}`.
