def is_prime(number):
'''<STR_LIT>'''<EOL>if number > <NUM_LIT:1>:<EOL><INDENT>'''<STR_LIT>'''<EOL>for time in range(<NUM_LIT:3>):<EOL><INDENT>'''<STR_LIT>'''<EOL>randomNumber = random.randint(<NUM_LIT:2>, number - <NUM_LIT:1>)<EOL>'''<STR_LIT>'''<EOL>if pow(randomNumber, number - <NUM_LIT:1>, number) != <NUM_LIT:1>:<EOL><INDENT>return False<EOL><DEDENT><DEDENT>return True<EOL><DEDENT>else:<EOL><INDENT>'''<STR_LIT>'''<EOL>return False<EOL><DEDENT>
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