Sum of primes in odd positions is prime: Difference between revisions

{{trans|Nim}}

I n == 2

R 1B

s += p

I is_prime(s)

{{out}}

=={{header|Action!}}==

{{libheader|Action! Tool Kit}}

BYTE FUNC IsPrime(CARD x)

FI

OD

{{out}}

[https://gitlab.com/amarok8bit/action-rosetta-code/-/raw/master/images/Sum_of_primes_in_odd_positions_is_prime.png Screenshot from Atari 8-bit computer]

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

{{libheader|ALGOL 68-primes}}

PR read "primes.incl.a68" PR

INT max prime = 999;

FI

OD

{{out}}

<pre>

=={{header|AWK}}==

# syntax: GAWK -f SUM_OF_PRIMES_IN_ODD_POSITIONS_IS_PRIME.AWK

# converted from Ring

return(1)

}

{{out}}

<pre>

=={{header|C}}==

#include<stdlib.h>

}

return 0;

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

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

// Sum of primes in odd positions is prime. Nigel Galloway: November 9th., 2021

primes32()|>Seq.chunkBySize 2|>Seq.mapi(fun n g->(2*n+1,g.[0]))|>Seq.scan(fun(n,i,g)(e,l)->(e,l,g+l))(0,0,0)|>Seq.takeWhile(fun(_,n,_)->n<1000)|>Seq.filter(fun(_,_,n)->isPrime n)|>Seq.iter(fun(n,g,l)->printfn $"i=%3d{n} p[i]=%3d{g} sum=%5d{l}")

{{out}}

<pre>

=={{header|Factor}}==

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

prettyprint sequences.extras ;

{{out}}

<pre>

=={{header|Fermat}}==

=={{header|FreeBASIC}}==

dim as uinteger i = 1, p, sum = 0

for p = 2 to 999

i = i + 1

end if

=={{header|Go}}==

{{trans|Wren}}

{{libheader|Go-rcu}}

import (

}

}

{{out}}

=={{header|GW-BASIC}}==

20 A = 1

30 PRINT 1, 2, 2

250 IF Q = 1 THEN PRINT A, T, S

260 P = T

=={{header|jq}}==

See e.g. [[Erd%C5%91s-primes#jq]] for a suitable implementation of `is_prime`.

def task:

| "\(.i|lpad(3)) \($oddPositionPrimes[$i]|lpad(3)) \(.sum|lpad(5))" ) ;

{{out}}

<pre>

=={{header|Julia}}==

{{trans|Factor}}

p = primes(1000)

arr = filter(n -> isprime(n[2]), accumulate((x, y) -> (y, x[2] + y), p[1:2:length(p)], init = (0, 0)))

println(join(arr, "\n"))

<pre>

(2, 2)

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

p = {p, Accumulate[p]} // Transpose;

{{out}}

<pre>{{2,2},{5,7},{31,89},{103,659},{149,1181},{331,5021},{467,9923},{499,10909},{523,11941},{653,17959},{823,26879}}</pre>

=={{header|Nim}}==

template isOdd(n: Natural): bool = (n and 1) != 0

inc sum, p

if sum.isPrime:

{{out}}

=={{header|PARI-GP}}==

{{out}}

<pre>

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use ntheory 'is_prime';

printf "%6d%6d%6d\n", $c, $odd[$_], $sums[$_] if is_prime $sums[$_];

$c += 2;

{{out}}

<pre> 1 2 2

=={{header|Phix}}==

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #004080;">sequence</span> <span style="color: #000000;">primes</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: #008080;">end</span> <span style="color: #008080;">if</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">for</span>

{{out}}

<pre>

=={{header|Raku}}==

my @sums = [\+] @odd;

{{out}}

<pre> 1 2 2

=={{header|REXX}}==

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

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

end /*k*/ /* [↑] only process numbers ≤ √ J */

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

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

<pre>

=={{header|Ring}}==

load "stdlib.ring"

see "working..." + nl

see "done..." + nl

{{out}}

<pre>

=={{header|Ruby}}==

sum = 0

puts "%6d%6d%6d" % [i, odd_i, sum] if (sum += odd_i).prime?

end

{{out}}

<pre> 1 2 2

=={{header|Sidef}}==

1e3.primes.each_kv {|k,v|

if (k+1 -> is_odd) {

say "#{k+1} #{v} #{sum}" if sum.is_prime

}

{{out}}

<pre>

=={{header|Tiny BASIC}}==

LET S = 0

LET P = 1

GOSUB 100

IF Z = 1 THEN PRINT I," ", P," ", S

{{out}}<pre>1 2 2

{{libheader|Wren-trait}}

{{libheader|Wren-fmt}}

import "/trait" for Indexed

import "/fmt" for Fmt

sum = sum + se.value

if (Int.isPrime(sum)) Fmt.print("$3d $3d $,6d", se.index + 1, se.value, sum)

{{out}}

=={{header|XPL0}}==

int N, I;

[if N <= 1 then return false;

];

];

{{out}}

=={{header|Yabasic}}==

{{trans|XPL0}}

// by Galileo, 04/2022

end if

end if

{{out}}

<pre>i p(n) sum