Python-Code

def get_prim(last: int):
    prim = [2]
    for i in range(prim[0], last):
        is_prim = True
        for p in prim:
            if is_prim and i % p == 0:
                is_prim = False
        if is_prim:
            prim.append(i)
    return prim


def test_295(last: int):
    all_prim = get_prim(last)
    for i in range(0, len(all_prim) - 2):
        if all_prim[i + 1] - all_prim[i] == 2:
            print("(%d, %d)" % (all_prim[i], all_prim[i + 1]))


if __name__ == '__main__':
    test_295(2000)

Python-Code

def check_prime(number):
    for index in range (2, number//2 + 1):
        if number % index == 0:
            return False
    return True

solution = []
for index in range(2, 2001):
    if check_prime(index) and check_prime(index+2):
        solution.append((index, index+2))
print(solution)