python/wip/023-non_abudant_sums.py


1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16

# def getAllDivisorOf(num):
#     divisor_list = []
#     for i in range(1, num):
#         if num % i == 0:
#             divisor_list.append(i)
#     return divisor_list


# for num in range(1, 28123 + 1):
#     pass

# for i in range(3):
#     for j in range(3):
#         for k in range(3):
#             if i != j and i != k and j != k:
#                 print(i, j, k)