Exemplo n.º 1
0
		j=0
		factors=[]
		for d in div:
			if p.factor(d)==None:
				f=f/d
				f*=(d-1)
				factors.append(d)
				j+=1
		return (n/(f*1.0),f,n,j,factors)
		
pa=[]


primes=[]
for i in range(2,4000):
	if p.factor(i)==None:
		primes.append(i)
			
for ip1 in range(0,len(primes)):
	for ip2 in range(ip1,len(primes)):
		a=ffn(primes[ip1]*primes[ip2])
		if(isPerm(a[1],a[2])):
			pa.append(a)		

pa.sort()	
print pa
			
		
"""
check=[]
for p1 in primes:
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
import math
from math import *
import itertools
import decimal
from decimal import *
from collections import deque
from prime import Prime
import operator
import string
from sets import Set

p = Prime()
primes=[]
j=0
for i in range(2,2000):
	if(p.factor(i)==None):
		primes.append(i)
		if i==4159:
			print j
		j+=1	

def removeFromList(n,l):
	lis=[]
	for iL in range(0,len(l)):
			if(n == l[iL]):
				lis=l[:iL]+l[iL+1:]
	return lis	

def checkNums(n1,n2):
	str1=str(n1)
	str2=str(n2)
Exemplo n.º 4
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()
num=1
sumtotal=1
diagonals=[]
diagPrimes=[]
for x in range(1,15000):
	for y in range(1,5):
		num=num+2*x
		diagonals.append(num)
		if p.factor(num)==None:
			diagPrimes.append(num)
	if(len(diagPrimes)*(1.0)/(len(diagonals)+1)*(1.0))<0.10:
		print num**0.5
		break
Exemplo n.º 5
0
import math
from math import *
import itertools
import decimal
from decimal import *
from collections import deque
from prime import Prime
import operator
import string
from sets import Set

p = Prime()
primes=[]
j=0
for i in range(2,2000):
	if(p.factor(i)==None):
		primes.append(i)
		if i==4159:
			print j
		j+=1	

def removeFromList(n,l):
	lis=[]
	for iL in range(0,len(l)):
			if(n == l[iL]):
				lis=l[:iL]+l[iL+1:]
	return lis	

def checkNums(n1,n2):
	str1=str(n1)
	str2=str(n2)
Exemplo n.º 6
0
	i=0
	s=""
	while(i<len(t)):
		s+=str(t[i])
		i+=1
	return s
	
p = Prime()
L = p.factorize(644)

print tupleToStr(list(itertools.permutations("1234"))[0])

def isPerm(n1,n2,n3):
	permsN1=list(itertools.permutations(str(n1)))
	size=len(permsN1)
	perms=[]
	for i in range(0,size):
		perms.append(int(tupleToStr(permsN1[i])))
	if(n2 in perms and n3 in perms):
		print n1,n2,n3
		
isPerm(1487,4817,8147)

for i in range(1000,8000):
	if(p.factor(i)==None and p.factor(i+3330)==None and p.factor(i+2*3330)==None):
		if(isPerm(i,i+3330,i+3330*2)):
			print i,i+3330,i+3330
Exemplo n.º 7
0
from prime import Prime

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

print f,L
Exemplo n.º 8
0
from sets import Set

def divisors(n):
	div=[]
	for i in range (2,int(math.sqrt(n))+1):
		if(n%i==0):
			if(n/i != i):
				div.append(i)
				div.append(n/i)
			else:
				div.append(i)
	return div

p = Prime()
primes=[]
nfn=[]	
for n in range(2,1000001):
	if p.factor(n)==None:
		nfn.append((n/((n-1)*1.0),n))
	else:
		div=divisors(n)
		f=n
		for d in div:
			if p.factor(d)==None:
				f=f/d
				f*=(d-1)
		nfn.append((n/(f*1.0),n))

print max(nfn)