Rosetta Code:CalmoSoft primes: Revision history

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

8 April 2023

7 April 2023

  • curprev 07:1307:13, 7 April 2023CalmoSoft talk contribs 284 bytes −1,554 →‎{{header|Ring}}
  • curprev 06:5506:55, 7 April 2023CalmoSoft talk contribs 1,838 bytes +1,838 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..."