CalmoSoft primes: Difference between revisions

no edit summary
(Added stretch goal)
No edit summary
Line 1:
{{draft task}}
;Definition
Let p(1), p(2), p(3), ... , p(n) be consecutive prime numbers, where p(n) < 100. If the sum of any consecutive sub-sequence of these numbers is a prime number, then the numbers in such a sub-sequence are called '''CalmoSoft primes'''.
<br><br>
;Task
7,806

edits