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

=={{header|ALGOL 68}}==

Same as the [[Summarize primes#ALGOL_68]] solution.

INT max prime = 999; # largest prime to consider #

# sieve the primes to max prime #

)

)

{{out}}

<pre>

</pre>

=={{header|AWK}}==

# syntax: GAWK -f PRIME_NUMBERS_P_WHICH_SUM_OF_PRIME_NUMBERS_LESS_OR_EQUAL_TO_P_IS_PRIME.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

=={{header|F_Sharp|F#}}==

This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]

// Primes (+)2..p is prime. Nigel Galloway: July 7th., 2021

primes32()|>Seq.takeWhile((>)1000)|>Seq.scan(fun(n,_) g->(n+g,g))(0,0)|>Seq.filter(fun(n,_)->isPrime n)|>Seq.iter(fun(_,n)->printf "%d " n); printfn ""

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

prettyprint ;

 

{{out}}

<pre>

 

=={{header|FreeBASIC}}==

Dim As Integer column = 0, sum = 0, limit = 1000

 

Color 10 : Print !"\n\nEncontrados "; column; " n£meros."

Sleep

{{out}}

<pre>

=={{header|Go}}==

{{trans|Wren}}

 

import (

}

fmt.Println("\nFound", len(results), "such primes")

 

{{out}}

 

=={{header|J}}==

{{out}}

<pre>2 3 7 13 37 43 281 311 503 541 557 593 619 673 683 733 743 839 881 929 953</pre>

used here.

 

 

# Output: a stream of primes in range(0;$n)

"\nFound \(length) such primes." );

 

{{out}}

<pre>

 

=={{header|Julia}}==

 

primesumto(N) = begin s = 0; [i => s for i in 1:N if isprime(i) && isprime(s += i)] end

end

println("\nTotal such primes < 1000: ", length(primesumdict))

<pre>

Prime Prime Sum to Prime

 

=={{header|Mathematica}} / {{header|Wolfram Language}}==

Partition[

cands[[Flatten@Position[PrimeQ /@ Accumulate[cands], True]]],

 

{{out}}<pre>

 

=={{header|Nim}}==

 

const

 

echo "Found $# primes:".format(list.len)

 

{{out}}

 

=={{header|Perl}}==

 

use strict; # https://rosettacode.org/wiki/Prime_numbers_p_which_sum_of_prime_numbers_less_or_equal_to_p_is_prime

use ntheory qw( is_prime primes vecsum );

 

{{out}}

<pre>

=={{header|Phix}}==

As per Raku, this is pretty much an exact duplicate of [[Summarize_primes#Phix]], bar output of primes instead of their index.

<span style="color: #008080;">function</span> <span style="color: #000000;">sump</span><span style="color: #0000FF;">(</span><span style="color: #004080;">integer</span> <span style="color: #000000;">p</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">i</span><span style="color: #0000FF;">,</span> <span style="color: #004080;">sequence</span> <span style="color: #000000;">s</span><span style="color: #0000FF;">)</span> <span style="color: #008080;">return</span> <span style="color: #7060A8;">is_prime</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">sum</span><span style="color: #0000FF;">(</span><span style="color: #000000;">s</span><span style="color: #0000FF;">[</span><span style="color: #000000;">1</span><span style="color: #0000FF;">..</span><span style="color: #000000;">i</span><span style="color: #0000FF;">]))</span> <span style="color: #008080;">end</span> <span style="color: #008080;">function</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">res</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">filter</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">get_primes_le</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1000</span><span style="color: #0000FF;">),</span><span style="color: #000000;">sump</span><span style="color: #0000FF;">)</span>

<span style="color: #7060A8;">printf</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1</span><span style="color: #0000FF;">,</span><span style="color: #008000;">"%d found: %V\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">length</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">),</span><span style="color: #000000;">res</span><span style="color: #0000FF;">})</span>

{{out}}

<pre>

=={{header|Raku}}==

Trivial variation of [[Summarize_primes#Raku|Summarize primes]] task. Modified to do double duty.

 

my @primes = grep *.is-prime, ^Inf;

}

).join("\n")

{{out}}

<pre>76 cumulative prime sums:

 

=={{header|REXX}}==

parse arg hi cols . /*obtain optional argument from the CL.*/

if hi=='' | hi=="," then hi= 1000 /*Not specified? Then use the default.*/

#= #+1; @.#= j; sq.#= j*j; !.j= 1 /*bump # of Ps; assign next P; P²; P# */

if @.#<hi then sP= sP + @.# /*maybe add this prime to sum─of─primes*/

{{out|output|text=&nbsp; when using the default inputs:}}

<pre>

 

=={{header|Ring}}==

load "stdlib.ring"

see "working..." + nl

see nl + "Found " + row + " numbers" + nl

see "done..." + nl

{{out}}

<pre>

 

=={{header|Sidef}}==

var s = 0

n.each_prime {|p|

primes_with_prime_sum(1000, {|p,s|

say "prime: #{'%3s' % p} prime sum: #{'%5s' % s}"

{{out}}

<pre>

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "/seq" for Lst

import "/fmt" for Fmt

System.print("Primes 'p' under 1000 where the sum of all primes <= p is also prime:")

for (chunk in Lst.chunks(results, 7)) Fmt.print("$4d", chunk)

 

{{out}}

 

=={{header|XPL0}}==

int N, I;

[if N <= 1 then return false;

Text(0, " such numbers found below 1000.

");

 

{{out}}