CalmoSoft primes: Difference between revisions
m
→Stretch task
m (→Stretch task) |
|||
Line 992:
def calmo_prime_sequence(
""" find the largest prime seq in primes <
pri = list(primerange(
for
for d in range(-1,
if d >=
psum -= pri[d]
f'Longest Calmo prime seq (length {window_size}) of primes less than {N} totals {sum(pri[i:i+window_size])}:')▼
if isprime(psum):
print('Longest Calmo prime seq (length', w,
▲
if w > 24:
print(''.join(list(str(pri[d+1:d+6]))[:-2]), ", ... ",
''.join(list(str(pri[d-5+w:d+w]))[1:]), "\n")
else:
print("The sequence is: ", pri[
return
calmo_prime_sequence()▼
▲ calmo_prime_sequence(pmax)
</syntaxhighlight>{{out}}
<pre>
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:▼
Longest Calmo prime seq (length 41530 ) of primes less than 500000 totals 9910236647
[7, 11, 13, 17, 19, 23, ... 49999699, 49999711, 49999739, 49999751, 49999753, 49999757]▼
[2, 3, 5, 7, 1 , ... 499787, 499801, 499819, 499853, 499879]
</pre>
| |||