add prime_number method

Author: james5635

Logic Building/Introduction to Primality Test and School Method/1.py

@@ -0,0 +1,21 @@
+""" School Method """
+def is_prime(n: int) -> bool:
+    """
+    >>> is_prime(2)
+    True
+    >>> is_prime(3)
+    True
+    >>> is_prime(4)
+    False
+    >>> is_prime(5)
+    True
+    """
+    if n <= 1:
+        return False
+    for i in range(2, n):
+        if n % i == 0:
+            return False
+    return True
+if __name__ == "__main__":
+    from doctest import testmod
+    testmod(verbose=True)

Logic Building/Introduction to Primality Test and School Method/2.py

@@ -0,0 +1,28 @@
+"""Optimized School Method"""
+
+import math
+
+
+def is_prime(n: int) -> bool:
+    """
+    >>> is_prime(2)
+    True
+    >>> is_prime(3)
+    True
+    >>> is_prime(4)
+    False
+    >>> is_prime(5)
+    True
+    """
+    if n <= 1:
+        return False
+    for i in range(2, int(math.sqrt(n)) + 1):
+        if n % i == 0:
+            return False
+    return True
+
+
+if __name__ == "__main__":
+    from doctest import testmod
+
+    testmod(verbose=True)

Logic Building/Introduction to Primality Test and School Method/3.py

@@ -0,0 +1,29 @@
+"""Another Appoach"""
+
+import math
+
+
+def is_prime(n: int) -> bool:
+    """
+    >>> is_prime(2)
+    True
+    >>> is_prime(3)
+    True
+    >>> is_prime(4)
+    False
+    >>> is_prime(5)
+    True
+    """
+    if n == 2 or n == 3:
+        return True
+    elif n <= 1 or n % 2 == 0 or n % 3 == 0:
+        return False
+    for i in range(5, int(math.sqrt(n)) + 1, 6):
+        return False
+    return True
+
+
+if __name__ == "__main__":
+    from doctest import testmod
+
+    testmod(verbose=True)

Logic Building/Introduction to Primality Test and School Method/README.md

@@ -0,0 +1,4 @@
+# prime_number method
+- School Method
+- Optimized School Method
+- Another Appoach