CalmoSoft primes: Difference between revisions

def calmo_prime_sequence(N=100):

""" find the largest prime seq in primes < N that sums to a prime """

pri = list(primerange(N))

for window_size in range(len(pri)+1, 1, -1):

for i in range(len(pri)-window_size):

if isprime(sum(pri[i:i+window_size])):

print(

f'Longest Calmo prime seq (length {window_size}) of primes less than {N} totals {sum(pri[i:i+window_size])}:')

if window_size > 24:

print('[', ', '.join(map(str, pri[i:i+6])), ', ... ', ', '.join(map(str, pri[i+window_size-6:i+window_size])), ']\n', sep='')

print(pri[i:i+window_size], '\n')

calmo_prime_sequence()

calmo_prime_sequence(50_000_000)

Longest Calmo prime seq (length 21) of primes less than 100 totals 953:

The sequence is: [7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89]

Longest Calmo prime seq (length 3001117) of primes less than 50000000 totals 72618848632313: