Question

Twin primes are primes that are exactly two apart. For example, 41 and 43, are twin primes. (The two Bushes were twin prime presidents — I’m surprised nobody ever pointed that out!) Write a function twinprimes(primes) that takes as input a list of prime numbers and returns another list twins containing all the twin primes. Be sure to write your code in such a way that the list primes remains unaltered. (It is known that there are infinitely many prime numbers. It is thought that there are infinitely many twin primes, but this is not known for sure.)

Use python for code

Provide notes/comments as well for as many statements as possible

Answer 1

def twinprimes(primes):
    result = []
    for p in primes:
        found = False
        for num in primes:
            if p - num == 2 or p - num == -2:
                found = True
        if found and p not in result:
            result.append(p)
    return result


print(twinprimes([17, 19, 29, 31, 27, 41, 47, 43]))