Project 3

from math import sqrt

def problem_3(seq):

    primes = [i for i in range(2, seq[0]) if seq[0] % i == 0]
    if seq[1] % primes[0] == 0:
        primes.reverse()
    for number in seq[1:]:
        primes.append(number // primes[len(primes) - 1])
    uniq_primes = set(primes)
    uniq_primes = list(uniq_primes)
    uniq_primes.sort()
    print(uniq_primes)
    a_dict = {i: c for i, c in zip(uniq_primes, 'ABCDEFGHJIKLMNOPQRSTUVWXYZ')}

problem_3([217, 1891, 4819, 2291, 2987, 3811, 1739, 2491, 4717, 445, 65, 1079, 8383, 5353, 901, 187, 649, 1003, 697, 3239, 7663, 291, 123, 779, 1007, 3551, 1943, 2117, 1679, 989, 3053])