def goldbach_split(n):
primes = sieve(n)
for i in range(int(n**(1 / 2)) + 1):
for j in primes:
if j + 2 * i**2 == n:
return True
return False
def main():
primes = sieve(20000)
for j in range(0, 1000000):
if j % 1000 == 0:
print(j)
if all(len(factors(j + i, primes)) == 4 for i in range(4)):
print(f'----------->{j}<-------------')
break
def main(): lim = 1000000 primes = sieve(lim) length = 0 largest = 0 last_prime = len(primes) # print(len(primes)) for i in range(len(primes)): for j in range(i+length, last_prime): s = sum(primes[i:j]) if s < lim: if s in primes: length = j-i # print(length) largest = s else: break print(largest) print(length)
# -*- coding: utf-8 -*-
#!/usr/bin/env python
import functions
for i in functions.sieve(1000000000)[::-1]:
if len(set(str(i))) == len(str(i)):
print i
break
from functions import sieve, isPrime
primes = sieve(1000)[1:]
def sum_of_digits(n):
return sum([int(i) for i in str(n)])
for idx, i in enumerate(primes):
# if idx == 1:
# break
s = set()
for j in primes:
if isPrime(int(str(j) + str(i))) and isPrime(int(str(i) + str(j))):
s.add(j)
print(s)
# s = set([j for j in primes if isPrime(int(str(j)+str(i))) and isPrime(int(str(i)+str(j)))])
# s = set(lst)
# print(lst)
# for j in s:
# if len(set([k for k in primes if isPrime(int(str(k)+str(j))) and isPrime(int(str(j)+str(k)))]))>len(lst):
# lst = [j]+[k for k in primes if isPrime(int(str(k)+str(j))) and isPrime(int(str(j)+str(k)))]
from functions import sieve if __name__=='__main__': print(sum(sieve(2000000)))
"""
The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.
"""
from functions import sieve
print sum(sieve(2000000))