def Prob_23(n): abundant = [] allnum = [] total = 395465626 for i in range(12,n): divisor = [] isPrime = MyFunctions.Prime(i) if isPrime == False: for j in range (1,i): z = i % j if z == 0: divisor.append(j) if sum(divisor) > i: abundant.append(i) #if i == 945: #print divisor, ' ',sum(divisor) #if sum(divisor)<i: #print i, ' is deficient, its sum is ',sum(divisor),' ',divisor #elif sum(divisor) == i: #print i, ' is perfect, its sum is ',sum(divisor),' ',divisor #else: #print i, ' is abundant, its sum is ',sum(divisor),' ',divisor #abundant.append(i) #print abundant #print len(abundant) for x in range(1,28124): allnum.append(x) #print allnum print sum(allnum) return total
def Prob_10():
ans = 17
for x in range(8, 2000000):
isPrime = MyFunctions.Prime(x)
if isPrime == 1:
ans = ans + x
return ans
def Prob_35(n):
count = 4
for i in range (10,n):
isPrime = MyFunctions.Prime(i)
sw = 1
if isPrime == True:
number = map(str,str(i))
perm = permutations(number)
for j in list(perm):
magic = lambda number: int(''.join(str(j) for j in number)) # Generator exp.
newnum = magic(j)
isPrime2 = MyFunctions.Prime(newnum)
if isPrime2 == True:
continue
else:
sw = 0
if sw == 1:
count += 1
return count
def Prob_7():
sw = 1
x = 2
y = 3
while sw == 1:
isPrime = MyFunctions.Prime(y)
if isPrime == 1:
if x == 10001:
sw = 0
else:
y = y + 2
x = x + 1
else:
y = y + 2
return y
def Prob_37(n):
MyFile = open("prob_37.txt","w")
for i in range (11,n):
isPrime = MyFunctions.Prime(i)
if number == 1:
values = list(str(i))
#if str(4) not in values:
#if str(6) not in values:
#if str(8) not in values:
#print(i," ",values)
MyFile.write(str(i))
print(i)
MyFile.write("\n")
#values = list(str(i))
#print (values)
#for value in values:
#if 4,6,8,9
#x = str(i)
#print (x)
#while(len(x)>= 1):
return " "
