Exemplo n.º 1
0
from prime import Prime

p = Prime()
f = p.factor(45)
L = p.factorize(45)

print f,L
Exemplo n.º 2
0
#!/usr/bin/python
import math
from math import *
import itertools
import decimal
from decimal import *
from collections import deque
from prime import Prime
	
p = Prime()
L = p.factorize(644)

primes=[]
for i in range(2,10000):
	if p.factor(i)==None:
		primes.append(i)

sum=0
i=0
j=0
for j in range(0,60):
	max=600	
	while(max>0):
		i=j
		while(i<max+j):
			sum+=primes[i]
			i+=1
		if(p.factor(sum)==None and sum>900000 and sum<1000000):
			print sum,i-1-j
		max-=1			
		sum=0
Exemplo n.º 3
0
#!/usr/bin/python
import math
from math import *
import itertools
import decimal
from decimal import *
from collections import deque
from prime import Prime

p = Prime()
L = p.factorize(644)
print L

for i in range(100000,150000):
	fac1=len(sorted(set(p.factorize(i))))
	if(fac1==4):
		fac2=len(sorted(set((p.factorize(i-1)))))
		if(fac2==4):
			fac3=len(sorted(set((p.factorize(i-2)))))
			if(fac3==4):
				fac4=len(sorted(set((p.factorize(i-3)))))
				if(fac4==4):
					print i,i-1,i-2,i-3
					print p.factorize(i)
					print p.factorize(i-1)
					print p.factorize(i-2)
					print p.factorize(i-3)		
					break