y = list(x)
tmp = []
tmpr = []
for y1 in x:
z = log(MX) / log(y1)
z1 = y1**int(z)
#print y1, z1
tmp.append(z1)
tmpr.append(y1)
#exit()
for z in tmp:
x.append(z)
for z in tmpr:
x.remove(z)
x = sorted(x)
x.append(1)
y = sorted(y, reverse=False)
for z in y:
p = 0
nprev, zprev, Oprev = 0, 0, 0
makechange = False
vlog = log(MX) / log(z)
vmax = z**int(vlog)
#print "#$",z,vmax
while 1:
pm = [421, 443, 349, 379, 241, 83]
pms = permutations(pm)
for xms in pms:
print xms, "######"
x = RofPrimes(2, 200000)
x.append(1)
r = list(x)
x = sorted(x, reverse=True)
xs = RofPrimes(2, 444)
xs = sorted(xs, reverse=False)
for zz in xms:
x.remove(zz)
for zz in xms:
x.append(zz)
#x = sorted(x, reverse = False)
ps = []
ps2 = []
l = []
rj = []
exc = range(2, 20)
for sp in xs:
if sp in rj: continue
max = 0
Srch = RofPrimes(SqMax-1,MX)
SqSet = sorted(RofPrimes(2,SqMax),reverse = False)
pused=[]
dupes = []
ctr = 0
prev = 0
for i in SqSet:
ctr +=1
nval,nb,np,diff = MaxNum(i,MX,Srch)
pused.append(np)
pused.append(nb)
#print i, nval,nb,np,diff
dupes.append([i,nb,np])
SubSet.remove(i)
# Search for duples in primes and search for next lowest free prime
prev = 0;prevnb=0
for i in xrange(len(dupes)-1):
v = dupes[i]
v1=v[1];v2 = v[2]
if v2==prev: #duple found
prevp = prevprime(v2,pused)
dupes[i-1]=[i-1,prevnb,prevp]
prevnb = v1;prev = v2
Srch = RofPrimes(SqMax - 1, MX)
SqSet = sorted(RofPrimes(2, SqMax), reverse=False)
pused = []
dupes = []
ctr = 0
prev = 0
for i in SqSet:
ctr += 1
nval, nb, np, diff = MaxNum(i, MX, Srch)
pused.append(np)
pused.append(nb)
#print i, nval,nb,np,diff
dupes.append([i, nb, np])
SubSet.remove(i)
# Search for duples in primes and search for next lowest free prime
prev = 0
prevnb = 0
for i in xrange(len(dupes) - 1):
v = dupes[i]
v1 = v[1]
v2 = v[2]
if v2 == prev: #duple found
prevp = prevprime(v2, pused)
dupes[i - 1] = [i - 1, prevnb, prevp]
prevnb = v1
return sum(L)
def notcoprime(cp,Y):
for yy in Y:
if gcd(yy,cp)!=1:
return yy
return -1
MX=10
x= RofPrimes(2,MX)
print GCD(x)
print x
print Sum(x)
y = list(x)
#x = sorted(x,reverse = False)
for i in xrange(MX-1,0,-1):
if i in y:continue
z= notcoprime(i,x)
print i,z
if z > 0 and i>z:
x.remove(z)
else:
x.append(i)
print sorted(x)
print Sum(x)
pm = [421, 443, 349, 379, 241, 83]
pms = permutations(pm)
for xms in pms:
print xms, "######"
x = RofPrimes(2, 200000)
x.append(1)
r = list(x)
x = sorted(x, reverse=True)
xs = RofPrimes(2, 444)
xs = sorted(xs, reverse=False)
for zz in xms:
x.remove(zz)
for zz in xms:
x.append(zz)
# x = sorted(x, reverse = False)
ps = []
ps2 = []
l = []
rj = []
exc = range(2, 20)
for sp in xs:
if sp in rj:
continue
from Functions import RofPrimes, RetFact,IsPrime,gcd x = RofPrimes(2,200000) x.append(1) r = list(x) x = sorted(x, reverse = True) xs = RofPrimes(2,444) xs = sorted(xs,reverse=False) x.remove(421) x.remove(443) x.remove(349) x.remove(379) x.remove(241) x.remove(83) x.append(421) x.append(443) x.append(349) x.append(379) x.append(241) x.append(83) ''' x.remove(3) xs.remove(3) x.append(177147) ''' #x = sorted(x, reverse = False)
from Functions import RofPrimes, RetFact,IsPrime,gcd x = RofPrimes(2,200000) x.append(1) print "init sum", sum(x) r = list(x) x = sorted(x, reverse = True) xs = RofPrimes(2,444) xs = sorted(xs,reverse=False) ''' xs.remove(421) xs.remove(443) xs.remove(349) xs.remove(379) xs.remove(241) xs.remove(83) xs.append(421) xs.append(443) xs.append(349) xs.append(379) xs.append(241) xs.append(83) x.remove(3) xs.remove(3) x.append(177147)
tmp=[] tmpr=[] for y1 in x: z = log(MX)/log(y1) z1 = y1**int(z) tmp.append(z1) tmpr.append(y1) print x print tmp for z in tmp: x.append(z) for z in tmpr: x.remove(z) x = sorted(x) x.append(1) print x print Sum(x) #x2 = sorted(x,reverse = True) y = sorted(y,reverse=True) #y=[7,5,2] for z in y: #if z>=MX/2:break p = 0 nprev,zprev,Oprev=0,0,0 makechange = False
def notcoprime(cp,Y):
for yy in Y:
if gcd(yy,cp)!=1:
return yy
return -1
x = RofPrimes(2,200000)
x.append(1)
r = list(x)
x = sorted(x, reverse = True)
xs = RofPrimes(2,444)
xs = sorted(xs,reverse=False)
xs.remove(421)
xs.remove(443)
xs.remove(349)
xs.remove(379)
xs.remove(241)
xs.remove(83)
xs.append(421)
xs.append(443)
xs.append(349)
xs.append(379)
xs.append(241)
xs.append(83)
'''
x.remove(3)
def Sum(L):
return sum(L)
def notcoprime(cp, Y):
for yy in Y:
if gcd(yy, cp) != 1:
return yy
return -1
MX = 10
x = RofPrimes(2, MX)
print GCD(x)
print x
print Sum(x)
y = list(x)
#x = sorted(x,reverse = False)
for i in xrange(MX - 1, 0, -1):
if i in y: continue
z = notcoprime(i, x)
print i, z
if z > 0 and i > z:
x.remove(z)
else:
x.append(i)
print sorted(x)
print Sum(x)
#for MX in range(10, 101):
x= RofPrimes(2,MX)
y=list(x)
tmp=[]
tmpr=[]
for y1 in x:
z = log(MX)/log(y1)
z1 = y1**int(z)
tmp.append(z1)
tmpr.append(y1)
for z in tmp:
x.append(z)
for z in tmpr:
x.remove(z)
x = sorted(x)
x.append(1)
y = sorted(y,reverse=False)
for z in y:
#if z>=MX/2:break
p = 0
nprev,zprev,Oprev=0,0,0
makechange = False
vlog = log(MX)/log(z)
vmax = z**int(vlog)
#print "#$",z,vmax
while 1:
