ITDMAT - handin2 question 3a

def is_prime(n):
  if n == 2 or n == 3: return True
  if n < 2 or n%2 == 0: return False
  if n < 9: return True
  if n%3 == 0: return False
  r = int(n**0.5)
  f = 5
  while f <= r:
    if n%f == 0: return False
    if n%(f+2) == 0: return False
    f +=6
  return True

for n in range(42):
    num = n**2 + n + 41
    print("f(" + str(n) + "): " + str(n**2 + n + 41) + " is prime: "+ str(is_prime(num)))

#output
f(0): 41 is prime: True
f(1): 43 is prime: True
f(2): 47 is prime: True
f(3): 53 is prime: True
f(4): 61 is prime: True
f(5): 71 is prime: True
f(6): 83 is prime: True
f(7): 97 is prime: True
f(8): 113 is prime: True
f(9): 131 is prime: True
f(10): 151 is prime: True
f(11): 173 is prime: True
f(12): 197 is prime: True
f(13): 223 is prime: True
f(14): 251 is prime: True
f(15): 281 is prime: True
f(16): 313 is prime: True
f(17): 347 is prime: True
f(18): 383 is prime: True
f(19): 421 is prime: True
f(20): 461 is prime: True
f(21): 503 is prime: True
f(22): 547 is prime: True
f(23): 593 is prime: True
f(24): 641 is prime: True
f(25): 691 is prime: True
f(26): 743 is prime: True
f(27): 797 is prime: True
f(28): 853 is prime: True
f(29): 911 is prime: True
f(30): 971 is prime: True
f(31): 1033 is prime: True
f(32): 1097 is prime: True
f(33): 1163 is prime: True
f(34): 1231 is prime: True
f(35): 1301 is prime: True
f(36): 1373 is prime: True
f(37): 1447 is prime: True
f(38): 1523 is prime: True
f(39): 1601 is prime: True
f(40): 1681 is prime: False
f(41): 1763 is prime: False