Merge pull request prabhupant#355 from shotanozadze/master

prabhupant · web-flow · commit adc792e715fb · 2020-08-18T17:33:34.000+05:30
division factors
diff --git a/.gitignore b/.gitignore
@@ -1 +1,2 @@
 questions_to_do.txt
+.DS_Store
diff --git a/algorithms/math/divisors.py b/algorithms/math/divisors.py
@@ -0,0 +1,63 @@
+import math
+
+class divisors:
+
+    def findAllDivisors(self, n):
+        result = list()
+
+        for i in range(1, n+1):
+            if (n%i == 0): 
+                result.append(i)
+        
+        return result
+
+    def divisorsCount(self, n):
+        divs = self.findAllDivisors(n)
+        return len(divs)
+
+    def oddFactors(self, n):
+        result = list()
+
+        for i in range(1, n+1):
+            if (n%i == 0 and i%2==1): 
+                result.append(i)
+        
+        return result
+
+    def oddFactorsSum(self, n):
+        divs = self.evenFactors(n)
+        return sum(divs)
+
+    def evenFactors(self, n):
+        result = list()
+
+        for i in range(1, n+1):
+            if (n%i == 0 and i%2==0): 
+                result.append(i)
+        
+        return result
+
+    def evenFactorsSum(self, n):
+        divs = self.evenFactors(n)
+        return sum(divs)
+
+    def primeFactors(self, n):
+        result = list()
+
+        while n % 2 == 0: 
+            result.append(2) 
+            n = n / 2
+
+        for i in range(3,int(math.sqrt(n))+1,2): 
+            while n % i== 0: 
+                result.append(i) 
+                n = n / i 
+                
+        if n > 2: 
+            result.append(n)
+        
+        return result
+
+    def primeFactorsSum(self, n):
+        divs = self.primeFactors(n)
+        return sum(divs)
