Add is_prime function and an unit test for it

participants/scipy_014/pr_tutorial/simple_functions.py

@@ -10,3 +10,11 @@ def factorial(value):
         return 1
     else:
         return value * factorial(value - 1)
+
+def is_prime(value: int) -> bool:
+    if value <= 1:
+        return False
+    for i in range(2, value):
+        if value % i == 0:
+            return False
+    return True

participants/scipy_014/pr_tutorial/tests/test_simple_function.py

@@ -1,7 +1,19 @@
-from pr_tutorial.simple_functions import factorial
+from pr_tutorial.simple_functions import factorial, is_prime
 
 
 def test_factorial_3():
     """Simplest test for one crete case"""
 
     assert factorial(3) == 6
+
+def test_is_prime():
+    """Test for is_prime function"""
+    assert not is_prime(1)
+    assert is_prime(2)
+    assert is_prime(3)
+    assert not is_prime(4)
+    assert is_prime(5)
+    assert not is_prime(6)
+    assert is_prime(7)
+    assert not is_prime(8)
+    assert not is_prime(9)