Prime numbers p for which the sum of primes less than or equal to p is prime: Difference between revisions

← Older edit

Prime numbers p for which the sum of primes less than or equal to p is prime (view source)

Revision as of 22:29, 4 April 2024

1,901 bytes added , 1 month ago

Added Uiua solution

Midaz

62

edits

Revision as of 19:10, 5 June 2023 (view source) Achim121 (talk \| contribs) (→‎{{header\|Prolog}}) ← Older edit		Latest revision as of 22:29, 4 April 2024 (view source) Midaz (talk \| contribs) (Added Uiua solution)
(5 intermediate revisions by 5 users not shown)
Line 299: =={{header\|J}}== <syntaxhighlight lang="j">(+#~ 1: p: +/\)@(i.&.(p:^:_1)) 1000</syntaxhighlight> {{out}} <pre>2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953</pre> Line 396: 953 </pre> =={{header\|MiniScript}}== <syntaxhighlight lang="miniscript"> isPrime = function(n) if n <= 3 then return n > 1 if n % 2 == 0 or n % 3 == 0 then return false i = 5 while i ^ 2 <= n if n % i == 0 or n % (i + 2) == 0 then return false i += 6 end while return true end function primes = [] sum = 0 for n in range(2, 1000) if isPrime(n) then sum += n if isPrime(sum) then primes.push(n) end if end for print primes.len + " found: " + primes </syntaxhighlight> {{out}} <pre>▼ 21 found: [2, 3, 7, 13, 37, 43, 281, 311, 503, 541, 557, 593, 619, 673, 683, 733, 743, 839, 881, 929, 953</pre> =={{header\|Nim}}== Line 501 ⟶ 531: true. </pre> =={{header\|Quackery}}== <code>isprime</code> is defined at [[Primality by trial division#Quackery]]. <syntaxhighlight lang="Quackery"> 0 1000 times [ i^ isprime if [ i^ + dup isprime if [ i^ echo sp ] drop ] ]</syntaxhighlight> {{out}} <pre>2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953</pre> =={{header\|Raku}}== Line 689 ⟶ 729: Found 21 numbers done... </pre> =={{header\|RPL}}== {{works with\|HP\|49}} « { } 0 0 '''WHILE''' DUP 1000 < '''REPEAT''' NEXTPRIME SWAP OVER + SWAP '''IF''' OVER ISPRIME? '''THEN''' ROT OVER + UNROT '''END''' '''END''' DROP2 » '<span style="color:blue">TASK</span>' STO {{out}} <pre> 1: { 2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953 } </pre> Line 726 ⟶ 779: prime: 929 prime sum: 66463 prime: 953 prime sum: 70241 </pre> =={{header\|Uiua}}== {{works with\|Uiua\|0.10.0-dev.1}} <syntaxhighlight lang="Uiua"> # Build primes by sieve. Limit found by inspection. ⇌◌⍢(▽≠0◿⊃⊢(.↘1)⟜(⊂⊢)\|>0⧻) ↘2⇡80000 [] # Build running sums. \+▽<1000... # # Find sums that are prime, then prettify. ⧻.⍉⊟:∩(⬚0▽),⟜∊ </syntaxhighlight> {{out}} <pre> ╭─ ╷ 2 2 3 5 7 17 13 41 37 197 43 281 281 7699 311 8893 503 22039 541 24133 557 25237 593 28697 619 32353 673 37561 683 38921 733 43201 743 44683 839 55837 881 61027 929 66463 953 70241 ╯ 21 </pre> =={{header\|Wren}}== {{libheader\|Wren-math}} ~~{{libheader\|Wren-seq}}~~ {{libheader\|Wren-fmt}} <syntaxhighlight lang="~~ecmascript~~wren">import "./math" for Int, Nums import "./~~seq~~fmt" for ~~Lst~~Fmt ~~import "/fmt" for Fmt~~ var primes = Int.primeSieve(1000, true) Line 746 ⟶ 836: } System.print("Primes 'p' under 1000 where the sum of all primes <= p is also prime:") Fmt.tprint("$4d", results, 7) ~~for (chunk in Lst.chunks(results, 7)) Fmt.print("$4d", chunk)~~ System.print("\nFound %(results.count) such primes.")</syntaxhighlight> Line 785 ⟶ 875: "); ]</syntaxhighlight> {{out}} <pre>2 3 7 13 37 43 281 311 503 541▼ ▲<pre> ▲2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953