# All public logs

Combined display of all available logs of Rosetta Code. You can narrow down the view by selecting a log type, the username (case-sensitive), or the affected page (also case-sensitive).

- 19:16, 24 September 2023 CalmoSoft talk contribs created page File:CalmoSoftFifteenPuzzle.png (This is a classic Fifteen Puzzle Game.)
- 19:16, 24 September 2023 CalmoSoft talk contribs uploaded File:CalmoSoftFifteenPuzzle.png (This is a classic Fifteen Puzzle Game.)
- 13:03, 23 April 2023 CalmoSoft talk contribs created page Extreme primes (Created 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:02, 17 April 2023 CalmoSoft talk contribs created page Special numbers (Created 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...")
- 07:40, 7 April 2023 CalmoSoft talk contribs created page CalmoSoft primes (Created 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)...")
- 06:55, 7 April 2023 CalmoSoft talk contribs created page Calmo prime numbers (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...")
- 15:06, 24 March 2023 CalmoSoft talk contribs created page Double Twin Primes (Created 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...")
- 08:32, 19 March 2023 CalmoSoft talk contribs created page Calmo numbers (Created page with "<big>Definition</big> Let n be a natural number. Let the real divisors of n be: d(1),d(2),d(3),...,d(k), where k is divisible by 3. Add the first three divisors, then the next three, and so on. If the partial sums are prime numbers, then n is called a Calmo number. <big>Example</big> n = 165 divisors = [3 5 11 15 33 55] 3 + 5 + 11 = 19 is prime number 15 + 33 + 55 = 103 is prime number <big>Task</big> let's find Calmo numbers under 1000. =={{header|Ring}}== <syntaxhighl...")
- 15:23, 10 February 2023 CalmoSoft talk contribs created page SEND + MORE = MONEY (Created page with "=={{header|Ring}}== This is a classic puzzle. </br> [https://mindyourdecisions.com/blog/2018/09/06/send-more-money-a-great-puzzle/ SEND + MORE = MONEY: A Great Puzzle] <syntaxhighlight lang="ring"> t1 = clock() // start see "works..." + nl + nl aListSend = [] aListMore = [] for s = 0 to 9 for e1 = 0 to 9 for n = 0 to 9 for d = 0 to 9 bool = s!=e1 and s!=n and s!=d and e1!=n and e1!=d and n!=d if bool...")
- 15:13, 10 February 2023 CalmoSoft talk contribs moved page SEND + MORE = MONEY: A Great Puzzle to Rosetta Code:SEND + MORE = MONEY: A Great Puzzle
- 14:47, 10 February 2023 CalmoSoft talk contribs created page SEND + MORE = MONEY: A Great Puzzle (Created page with "=={{header|Ring}}== This is a classic puzzle. [https://mindyourdecisions.com/blog/2018/09/06/send-more-money-a-great-puzzle/ SEND + MORE = MONEY: A Great Puzzle] <syntaxhighlight lang="ring"> t1 = clock() // start see "works..." + nl + nl aListSend = [] aListMore = [] for s = 0 to 9 for e1 = 0 to 9 for n = 0 to 9 for d = 0 to 9 bool = s!=e1 and s!=n and s!=d and e1!=n and e1!=d and n!=d if bool s...")
- 14:26, 10 February 2023 User account CalmoSoft talk contribs was created