aboutsummaryrefslogtreecommitdiff
path: root/python/wip/023-non_abudant_sums.py
diff options
context:
space:
mode:
authorCharles <sircharlesaze@gmail.com>2019-08-17 21:39:43 +0200
committerCharles <sircharlesaze@gmail.com>2019-08-17 21:39:43 +0200
commit3ffc76713f6db4c33f20588ce6896ea3c2bae2a7 (patch)
tree1025c801330f078e3a12da191f923ae8b6ddd81b /python/wip/023-non_abudant_sums.py
parent9a65938232d1fa9e1afe9a6eb2de48d25ff738a6 (diff)
downloadproject_euler-3ffc76713f6db4c33f20588ce6896ea3c2bae2a7.tar.gz
project_euler-3ffc76713f6db4c33f20588ce6896ea3c2bae2a7.tar.bz2
project_euler-3ffc76713f6db4c33f20588ce6896ea3c2bae2a7.zip
wip directory for each language
Diffstat (limited to 'python/wip/023-non_abudant_sums.py')
-rw-r--r--python/wip/023-non_abudant_sums.py16
1 files changed, 16 insertions, 0 deletions
diff --git a/python/wip/023-non_abudant_sums.py b/python/wip/023-non_abudant_sums.py
new file mode 100644
index 0000000..6e3eea2
--- /dev/null
+++ b/python/wip/023-non_abudant_sums.py
@@ -0,0 +1,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)