<pre><code># determine if numbers are prime
def Prime(num1):
divisor = 2
while divisor <= num1 / 2:
if num1 % divisor == 0:
return False # number is not a prime
divisor += 1
return True # number is prime
def printTwinPrimeNumbers(twinPrime):
NUMBER_OF_PRIMES = 50
NUMBER_OF_PRIMES_PER_LINE = 1
num1 = 3 # number to be tested starting point
count = 0
for i in range(0, 1001):
if Prime(num1):
num2 = num1 + 2
def prime2(num2):
count += 1
while divisor <= num2 / 2:
if num2 % divisor == 0:
return False # number is not a prime
divisor += 1
return True # number is prime
if prime2(num2):
print("(", num1, ",", num2, ")", end = '')
# makes sure only one is printed per line
if count % NUMBER_OF_PRIMES_PER_LINE == 0:
# Print the number and advance to the new line
print()
num1 += 1
def main():
print("The Twin Prime Numbers are: ")
printTwinPrimeNumbers(50)
main()# calls main function
</code></pre>