def main():
limit = 500
num = 0
round = 0
while True:
round += 1
num += round
if len(ft.factors(num)) > limit:
print num
break
def epform(num):
ep_form = []
l1 = factors(num)
for i in l1:
count = 0
be = []
while(num % i == 0):
count += 1
num /= i
be.append(i)
be.append(count)
ep_form.append(be)
return ep_form
def is_product_sum (num):
factors = factor.factors(num)[1:-1]
if len(factors) == 0: return 0
for i in factors:
if num/i in lookups:
for itr in lookups[num/i]:
lookups[num].append(itr+[i])
for i in range(int(ceil(len(factors)/2.))):
lookups[num].append([factors[i], num/factors[i]])
# check the index k corresponding to num
index = set()
for i in lookups[num]:
index.add(len(i)+num-sum(i))
return sorted(index)
def calculate(self, num):
"""
call factor_mod
"""
result = fact_mod.factors(num)
result = fact_mod.clean_up(result)
if not result:
self.scroll.delete(1.0, END)
self.scroll.insert('insert',
f"{format(num, ',')} is a prime number!")
self.scroll.pack()
else:
self.scroll.delete(1.0, END)
for i in range(0, len(result)):
self.scroll.insert('insert', f"# {i + 1}: {result[i]} \n")
self.scroll.pack()
#!/usr/bin/python
import factor
factors = []
for i in range(1, 10001):
a = factor.factors(i)
a = list(a)
list.sort(a)
a.pop()
factors.append(a)
lst = []
for number, fact in enumerate(factors, 1):
add = sum(fact)
for j, a in enumerate(factors, 1):
if add == j and number != j and sum(a) == number:
print number, j
if number not in lst:
lst.append(number)
if j not in lst:
lst.append(j)
print lst
print sum(lst)
import factor
def fun(x):
return (x**2+2)
y = 0
for iteratio in list(range(10000000000,10000001111)):
#z = fun(y)
z = iteratio
if len(factor.factors(z))==2:
print(z,len(factor.factors(z)),factor.factors(z))
y = z
#!/usr/bin/python
# This algorithmic code finds the value of the first triangle number
# that has over five hundred divisors(factors)
import factor
count = 2
while True:
tri_num = reduce(lambda x, y: x + y, xrange(1, count))
factors = factor.factors(tri_num)
print "No. of factors of the current triangle number is: ", len(factors)
if len(factors) > 500:
print "Found the first triangle number that has 500 factors," \
" and the number is", tri_num
break
else:
count += 1
def test_factor_13195(self):
self.number = 13195
result = factor.factors(self.number)
self.assertEqual(sorted(result), [5, 7, 13, 29])
def test_factor_600851475143(self):
self.number = 600851475143
result = factor.factors(self.number)
self.assertEqual(result, [6857, 1471, 839, 71])
print("Result: {0}".format(result[0]))
