Improved the Functionality of isPrime Function.

I improved the functionality of the isPrime Function to return Boolean values instead of just printing them so that it can also be used on other cases (i.e. if-else statements and while loops). This also compliments to printing True or False values. Also, I changed the capitalization of the isPrime Function to Camel Case just to cope up with the common convention🙂.

Author: menard-codes

Find if a number is prime or non-prime(OPTIMIZED).md

@@ -1,24 +1,19 @@
 A number is said to be prime if its only factors are 1 and the number itself. The code is an optimized approach to find the number is prime or not.
 ``` python
-def IsPrime(number):
+def isPrime(number):
     if number <= 1: #Flags if number is less than or equal to 1
-        print("False")
-        return
+        return False
     if number <= 3: #2 and 3 are prime numbers
-        print("True")
-        return
+        return True
     if ((number % 2 == 0) or (number % 3 == 0)): #checks for multiples of 2 and 3
-        print("False")
-        return
+        return False
     i = 5
     while (i * i <= number):
         if (number % i == 0 or number % (i + 2) == 0):
-            print("False")
-            return
+            return False
         i = i + 6
-    print("True")
-    return
+    return True
 
 
 
-```
+```