fix(day06): 素数方法 bug

Author: JalanJiang

day06/code/practice3.py

@@ -8,7 +8,7 @@
 from math import sqrt
 
 def is_prime(num):
-    for i in range(2, int(sqrt(num))):
+    for i in range(2, int(sqrt(num)) + 1):
         if num % i == 0:
             return False
     return True if num != 1 else False

day06/index.md

@@ -189,10 +189,13 @@ Date: 2019-05-22
 from math import sqrt
 
 def is_prime(num):
-    for i in range(2, int(sqrt(num))):
+    for i in range(2, int(sqrt(num)) + 1):
         if num % i == 0:
             return False
     return True if num != 1 else False
+
+n = int(input("输入 n："))
+print(is_prime(n))
 ```
 
 知识点：`return True if num != 1 else False` 简洁写法