# User contributions for CalmoSoft

A user with 2,468 edits. Account created on 10 February 2023.
Search for contributionsExpandCollapse
⧼contribs-top⧽
⧼contribs-date⧽
(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)

#### 23 April 2023

• 17:1417:14, 23 April 2023 +90 Extreme primes→‎{{header|Wren}}
• 13:0313:03, 23 April 2023 diff hist +1,123 N Extreme primesCreated page with "<big>Definition</big> <br><br> Write down the first prime number, add the next prime number and if it is prime, add it to the series and so on. These primes are called '''extreme primes''' <br><br> <big>Task</big> <br><br> Find and display the first '''30 p extreme prime''' number on this page. <br><br> =={{header|Ring}}== <syntaxhighlight lang="ring"> see "working..." + nl limit = 2000 Primes = [] for n = 1 to limit if isPrime(n) add(Primes,n) ok next..."

#### 17 April 2023

• 17:0217:02, 17 April 2023 diff hist +2,020 N Multiplicatively perfect numbersCreated page with "Definition <br><br> If the product of the divisors of an integer n (other than 1 and n itself) is equal to the number itself, then n is a special number. <br> Task <br> Find and show on this page the Special numbers where n < 500 <br> =={{header|Ring}}== <syntaxhighlight lang="ring"> see "working..." + nl limit = 500 Divisors = [] for n = 1 to limit pro = 1 Divisors = [] for m = 2 to ceil(sqrt(n))+1 if n % m = 0 pro = pro * m ad..."

#### 7 April 2023

• 07:4007:40, 7 April 2023 diff hist +1,860 N CalmoSoft primesCreated page with "'''Definition''' <br><br> Let p(1),p(2),p(3), ... ,p(n) be consecutive prime numbers, where p(n) < 100. If the sum of these numbers is a prime number, then these numbers are called '''CalmoSoft primes''' <br><br> '''Task''' <br><br> Let's find and show here the longest sequence of CalmoSoft primes. <br><br> =={{header|Ring}}== <syntaxhighlight lang="ring"> see "works..." + nl limit = 100 Primes = [] OldPrimes = [] NewPrimes = [] for p = 1 to limit if isPrime(p)..."
• 07:1307:13, 7 April 2023 −1,554 Rosetta Code:CalmoSoft primes→‎{{header|Ring}}
• 06:5506:55, 7 April 2023 diff hist +1,838 N Rosetta Code:CalmoSoft primesCreated 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..."

#### 24 March 2023

• 15:1515:15, 24 March 2023 +15 Double Twin Primes→‎{{header|Ring}}
• 15:0615:06, 24 March 2023 diff hist +1,158 N Double Twin PrimesCreated page with "'''Definition''' <br> Let (p1,p2) and (p3,p4) be twin primes where p3 - p2 = 4. <br> Such primes called '''Double Twin Primes''' <br> <br> '''Example''' <br> [5,7,11,13] <br> '''Task''' <br> Find and show here all Double Twin Primes under 1000. <br> =={{header|Ring}}== <syntaxhighlight lang="ring"> see "works..." + nl primes = [] limit = 1000 for n =1 to limit/2 if isPrime(n) add(primes,n) ok next lenPrimes = len(primes)-3 for m = 1 to lenPrimes if isP..."

#### 19 March 2023

(newest | oldest) View (newer 50 | ) (20 | 50 | 100 | 250 | 500)