code: def is_prime(number):
      
      ''' if number != 1 '''
      if number > 1:
          ''' repeat the test few times '''
          for time in range(3):
              ''' Draw a RANDOM number in range of number ( Z_number )  '''
              randomNumber = random.randint(2, number - 1)
              ''' Test if a^(n-1) = 1 mod n '''
              if pow(randomNumber, number - 1, number) != 1:
                  return False
          return True
      else:
          ''' case number == 1 '''
          return False
docs: Function to test primality of a number. Function lifted from online
      resource:
          http://www.codeproject.com/Articles/691200/Primality-test-algorithms-Prime-test-The-fastest-w
  
      This function is distributed under a separate licence:
          This article, along with any associated source code and files, is \
          licensed under The Code Project Open License (CPOL)
  
      :type number: int
      :param number: Integer to test for primality
  
      :returns: bool
  
      >>> is_prime(4)
      False
      >>> is_prime(3)
      True