Adding comments for understanding

Author: crackCodeLogn

primeNumbers.py

@@ -7,13 +7,28 @@
 
 
 def is_number_prime(number):
+    """
+    Function which checks whether the number is a prime number or not
+    :param number: integer - to be checked for prime-ness
+    :return: boolean - true if prime, else false
+    """
+
+    """
+    This is the main logic behind reducing the numbers to check for as factors
+        if N = a * b; where a<=b and a,b C (1, N)
+        then, a * b >= a*a;
+        which leads to => a*a <= N
+                       => a <= sqrt(N)
+    Hence checking only till the square root of N 
+    """
     upper_lim = Math.floor(Math.sqrt(number)) + 1
     is_prime = True if number != 1 else False
 
     for i in range(2, upper_lim):
         if number % i == 0:
             is_prime = False
             break
+            # The moment there is a divisor of 'number', break the iteration, as the number is not prime
 
     return is_prime