CalmoSoft primes: Difference between revisions
m
→Stretch task
Tag: Undo |
m (→Stretch task) |
||
Line 992:
def calmo_prime_sequence(
""" find the largest prime seq in primes <
pri = list(primerange(
for
for bot in range(-1, len(pri)-win): # the last bottom of window
if isprime(sum(pri[i:i+window_size])):▼
if bot >=
psum -= pri[bot]
f'Longest Calmo prime seq (length {window_size}) of primes less than {N} totals {sum(pri[i:i+window_size])}:')▼
print('[', ', '.join(map(str, pri[i:i+6])), ', ... ', ', '.join(map(str, pri[i+window_size-6:i+window_size])), ']\n', sep='')▼
print('Longest Calmo prime seq (length', win,
') of primes less than', maxp, 'totals', sum(pri[bot+1:bot+win+1]))
if win > 24:
▲ print('[', ', '.join(map(str, pri[
', '.join(map(str, pri[bot-5+win:bot+win+1])), ']\n', sep='')
else:
print('The sequence is:', pri[
return
for pmax in [100, 500_000, 50_000_000]:
calmo_prime_sequence(
</syntaxhighlight>{{out}}
<pre>
Longest Calmo prime seq (length 21 ) of primes less than 100 totals 953
The sequence is:
Longest Calmo prime seq (length 3001117) of primes less than 50000000 totals 72618848632313:▼
▲
[2, 3, 5, 7, 11, 13, ... 499787, 499801, 499819, 499853, 499879, 499883]
[7, 11, 13, 17, 19, 23, ... 49999699, 49999711, 49999739, 49999751, 49999753, 49999757]
</pre>
| |||