from prime_check import isprime
list_of_primes = []
num = 1000000
for i in range(1, 7000):
if isprime(i):
list_of_primes.append(i)
l = len(list_of_primes)
print l
for j in range(l, 500, -1):
for k in range(0, l - j):
sum = 0
ss = ''
for i in range(0 + k, j + k + 1):
sum = sum + list_of_primes[i]
if isprime(sum):
print sum
break
from prime_check import isprime
prim_list = []
for i in xrange(100):
if isprime(i):
prim_list += [i]
print prim_list
count = 1
prod = 1
while (prod <= 1000000):
prod = 1
for i in xrange(count):
prod *= prim_list[i]
count += 1
print prod
print count
prod = 1
for i in xrange(7):
prod *= prim_list[i]
print prod
#Dekh lena yaar
#I checked with 7 & 8
from prime_check import isprime
list_of_primes = []
num = 1000000
for i in range(1,7000):
if isprime(i) :
list_of_primes.append(i)
l = len(list_of_primes)
print l
for j in range ( l ,500,-1):
for k in range(0,l - j):
sum = 0
ss =''
for i in range(0+k,j+k+1):
sum = sum + list_of_primes[i]
if isprime(sum):
print sum
break
j = 2*i + 1
sj = str(j)
f = False
if sj.count('0') == 3:
f = True
elif sj.count('1') == 3:
if sj[5:] != '1':
f = True
elif sj.count('2') == 3:
f = True
else:
f = False
if f == True:
if isprime(j) :
list_of_primes.append(j)
for num in list_of_primes:
snum = str(num)
if snum.count('0') == 3:
count = 0
for i in range(10):
lk = snum.translate(maketrans("0",str(i) ))
if isprime(int(lk)):
count += 1
if count == 8 :
print snum
if snum.count('1') == 3:
from prime_check import isprime
prim_list = []
for k in range(2, 1000):
prim_list.append(k)
max_count = 0
for a in range(-999, 999):
for b in prim_list:
for i in range(0, 1000):
#print i,
#print isprime(i*i + a*i + b)
if isprime(i * i + a * i + b) == False:
if i > max_count:
max_count = i
max_a = a
max_b = b
break
print max_count
print max_a
print max_b
print max_a * max_b
from prime_check import isprime
list = []
for num in range(10,1000000):
next = True
for i in range(1,1+len(str(num))):
str_n = ''
for j in range(1,i+1):
str_n += str(num)[j-1]
if not isprime(int(str_n)):
next = False
break
if next:
for i in range(1,len(str(num))):
str_n = ''
for j in range(1,i+1):
str_n = str(num)[len(str(num)) - j] + str_n
if not isprime(int(str_n)):
next = False
break
if next:
list.append(num)
if len(list) == 11 :
print(sum(list))
print 'found'
break
print list
from prime_check import isprime
for num in range(2, 10000):
if num & 1:
if not isprime(num):
for i in range(1, num):
if num - 2 * i * i < 0:
print num
break
if isprime(num - 2 * i * i):
break
print 'end'
from prime_check import isprime
prim_list = []
for i in range(2,1000):
if isprime(i):
prim_list.append(i)
#print prim_list
for i in range(100000,140000):
num1 = i
num2 = i+1
num3 = i+2
num4 = i+3
count = 0
count1 = 0
count2 = 0
count3 = 0
loop_count = 0
next = False
for j in prim_list:
if j > num1:
break
if num1%j == 0:
count+= 1
if count == 4 :
from prime_check import isprime
n_prims = 0
num = 1
for i in range(2,100000):
denom = 4*i - 3
for a in range(1,5):
num += 2*(i-1)
if isprime(num):
n_prims += 1
if (float(n_prims)/denom) < 0.1 :
print 2*i - 1
break
print 'end'
from prime_check import isprime
prim_list = []
for k in range(2,1000):
prim_list.append(k)
max_count = 0
for a in range(-999,999):
for b in prim_list:
for i in range(0,1000):
#print i,
#print isprime(i*i + a*i + b)
if isprime(i*i + a*i + b) == False:
if i > max_count :
max_count = i
max_a = a
max_b = b
break
print max_count
print max_a
print max_b
print max_a*max_b
lisst = []
for i in perm_list:
num = ''
for j in range(0,8):
num = num + str(i[j])
if isprime(int(num)):
lisst.append(num)
print lisst
print 'end'
"""
perm_list = list(itertools.permutations([1,2,3,4,5,6,7]))
lisst = []
for i in perm_list:
num = ''
for j in range(0,7):
num = num + str(i[j])
if isprime(int(num)):
lisst.append(num)
print lisst[len(lisst) - 1]
print 'end'
perm_list = list(itertools.permutations([1,2,3,4,5,6,7,8]))
lisst = []
for i in perm_list:
num = ''
for j in range(0,8):
num = num + str(i[j])
if isprime(int(num)):
lisst.append(num)
print lisst
print 'end'
"""
perm_list = list(itertools.permutations([1, 2, 3, 4, 5, 6, 7]))
lisst = []
for i in perm_list:
num = ''
for j in range(0, 7):
num = num + str(i[j])
if isprime(int(num)):
lisst.append(num)
print lisst[len(lisst) - 1]
print 'end'
from prime_check import isprime
for num in range(2,10000):
if num & 1:
if not isprime(num):
for i in range(1,num):
if num - 2*i*i < 0:
print num
break
if isprime(num - 2*i*i):
break
print 'end'
