I'm really new to coding so I'm looking for a bit of feedback on this twin prime finder. She works pretty decent but I know it could be better.    import mathprimes = []def get_primes(lower, upper):  for num in range(lower, upper):    for i in range(2, num):      if num % i == 0:        break    else:      primes.append(num)print get_primes(int(raw_input(Enter lower boundary)), int(raw_input(Enter upper boundary)))print primesfor i in range(0, len(primes) - 1):  if primes[i+1] - primes[i] == 2:    print str(primes[i]), str(primes[i+1]) 
Simple twin prime finder
python;beginner;primes