Rosetta Code:CalmoSoft primes: Difference between revisions
Content deleted Content added
Created page with "'''Definition''' <br><br> Let p(1),p(2),p(3), ... ,p(n) be prime numbers, where p(n) < 100. If the sum of these primes is a prime number. then these numbers are called '''Calmo primes''' <br><br> '''Task''' <br><br> Find and show here the longest series of '''Calmo primes''' <br><br> =={{header|Ring}}== <syntaxhighlight lang="ring"> see "works..." + nl limit = 100 Primes = [] OldPrimes = [] NewPrimes = [] for p = 1 to limit if isPrime(p) add(Primes,p) ok n..." |
|||
Line 7:
Find and show here the longest series of '''Calmo primes'''
<br><br>
|
Revision as of 07:13, 7 April 2023
Definition
Let p(1),p(2),p(3), ... ,p(n) be prime numbers, where p(n) < 100. If the sum of these primes is a prime number. then these numbers are called Calmo primes
Task
Find and show here the longest series of Calmo primes