amicable_number_pairs.py

#
# amicable numbers
#
# https://www.google.com/search?q=amicable+numbers&sca_esv=574911510&sxsrf=AM9HkKmD1K8q_cX21m_etT7M5GRrlUX76g%3A1697738075291&source=hp&ei=W20xZc7QDsr3kwWAoL6QDQ&iflsig=AO6bgOgAAAAAZTF7azYujGZAuQyNrcQ2174wnbboiCPO&oq=amicable+nu&gs_lp=Egdnd3Mtd2l6IgthbWljYWJsZSBudSoCCAAyBRAAGIAEMggQABjLARiABDIIEAAYywEYgAQyCBAAGMsBGIAEMggQABjLARiABDIIEAAYywEYgAQyCBAAGMsBGIAEMggQABjLARiABDIIEAAYywEYgAQyCBAAGMsBGIAESLYiUABY3RhwAngAkAEAmAGbAqABmQ6qAQYwLjEyLjG4AQPIAQD4AQGoAgrCAgQQIxgnwgIHEC4YigUYJ8ICCBAAGIAEGLEDwgIREC4YgAQYsQMYgwEYxwEY0QPCAgsQABiABBixAxiDAcICCxAuGIoFGLEDGIMBwgILEC4YgAQYsQMYgwHCAgUQLhiABMICBxAjGOoCGCfCAgcQIxiKBRgnwgIIEC4YgAQYsQPCAgsQLhiDARixAxiABMICFBAuGIAEGLEDGIMBGMcBGNEDGNQCwgILEAAYigUYsQMYgwHCAgsQLhiABBjHARivAcICChAAGIAEGEYY_wE&sclient=gws-wiz#vhid=rBP4c6-pOwbBzM&vssid=l

d = {}
temp = []
for i in range(1, 10000):

    temp = []
    for j in range(1, i):

        if i % j == 0:
            temp.append(j)
# we don't need prime numbers
    if len(temp) > 1:
        d[i] = temp


dami = {}
sume = 0
for e in d.keys():
    sume = sum(d[e])
    if sume == 1:
        continue
    # print(e, sume, d[e])
    for f in d.keys():

        if f == e:
            continue
        sumf = sum(d[f])
        if sumf == 1:
            continue
        if  sume == sum(d[f]):
            dami[e] = [f, e, sume, sumf]

def divs(val):
    d_l = []
    sumd = 0
    for x in range(1, val):
        if val % x == 0:
            d_l.append(x)
            sumd += x
    return (sum(d_l), d_l, )