aboutsummaryrefslogtreecommitdiffstats
path: root/bigfactors2.py.orig
diff options
context:
space:
mode:
authormjfernez <mjfernez@gmail.com>2020-02-03 23:04:10 -0500
committermjfernez <mjfernez@gmail.com>2020-02-03 23:04:10 -0500
commit8e431d287c0e89041506da4c4da57e3e3d657d72 (patch)
treeb6cd296fbdd75d1421fe84a82cf3eec859407dcb /bigfactors2.py.orig
parente6a7399134b3dc08f9e6e9c9c74e39ac449b8538 (diff)
downloadProject_Euler_Solutions-8e431d287c0e89041506da4c4da57e3e3d657d72.tar.gz
cleanup, added c translations for some
Diffstat (limited to 'bigfactors2.py.orig')
-rw-r--r--bigfactors2.py.orig32
1 files changed, 32 insertions, 0 deletions
diff --git a/bigfactors2.py.orig b/bigfactors2.py.orig
new file mode 100644
index 0000000..41bc13d
--- /dev/null
+++ b/bigfactors2.py.orig
@@ -0,0 +1,32 @@
+import PIL, math
+
+#Problem 12 Highly divisible triangular number
+#finds the first number with over 500 factors
+
+def countfactors(num):
+ factors = 0
+ ### we only need to know about the FIRST HALF of factors,
+ ##one factor implies a second
+ root = int(math.ceil(math.sqrt(num)))
+ divs = range(1, root)
+ for d in divs:
+ if(num%d == 0):
+ factors += 2
+
+ #Correction if the number is a perfect square
+ if (root * root == num):
+ factors-=1
+ return factors
+
+
+#### MAIN #####
+i=1
+k=1
+j = 0
+while(k < 500):
+ j += i
+ k=countfactors(j)
+ print(str(j) + " has " + str(k) + " factors")
+ i += 1
+
+print("Ding! Ding! {} has over 500 factors, wow!".format(j))