Sum of two adjacent numbers are primes: Difference between revisions

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

{{libheader|ALGOL 68-primes}}

PR read "primes.incl.a68" PR # include prime utilities #

[]BOOL prime = PRIMESIEVE 200; # should be enough primes #

FI

OD

{{out}}

<pre>

</pre>

=={{header|AWK}}==

# syntax: GAWK -f SUM_OF_TWO_ADJACENT_NUMBERS_ARE_PRIMES.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

==={{header|BASIC256}}===

{{trans|FreeBASIC}}

if v < 2 then return False

if v mod 2 = 0 then return v = 2

end if

end while

{{out}}

<pre>

 

==={{header|FreeBASIC}}===

If ValorEval <= 1 Then Return False

For i As Integer = 2 To Int(Sqr(ValorEval))

End If

Loop

{{out}}

<pre>The first 20 pairs of numbers whose sum is prime:

 

==={{header|PureBasic}}===

If v <= 1 : ProcedureReturn #False

ElseIf v < 4 : ProcedureReturn #True

ForEver

CloseConsole()

{{out}}

<pre>

{{works with|QuickBasic|4.5}}

{{trans|FreeBASIC}}

IF ValorEval <= 1 THEN isPrime = 0

FOR i = 2 TO INT(SQR(ValorEval))

END IF

LOOP

{{out}}

<pre>

 

==={{header|True BASIC}}===

IF ValorEval <= 1 THEN LET isPrime = 0

FOR i = 2 TO INT(SQR(ValorEval))

END IF

LOOP

{{out}}

<pre>

 

==={{header|Yabasic}}===

if v < 2 then return False : fi

if mod(v, 2) = 0 then return v = 2 : fi

end if

loop

{{out}}

<pre>

=={{header|C}}==

{{trans|Go}}

#include <stdlib.h>

#include <math.h>

free(primes);

return 0;

 

{{out}}

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

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

// 2n+1 is prime. Nigel Galloway: Januuary 22nd., 2022

primes32()|>Seq.skip 1|>Seq.take 20|>Seq.map(fun n->n/2)|>Seq.iteri(fun n g->printfn "%2d: %2d + %2d=%d" (n+1) g (g+1) (g+g+1))

{{out}}

<pre>

=={{header|Factor}}==

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

math.primes.lists sequences ;

 

20 lprimes cdr [ 2/ dup 1 + 2array ] lmap-lazy ltake

{{out}}

<pre>

=={{header|Go}}==

{{libheader|Go-rcu}}

 

import (

hp := p / 2

fmt.Printf("%2d + %2d = %2d\n", hp, hp+1, p)

 

{{out}}

Here, we generate the first 20 odd primes, divide by 2, drop the fractional part and add 0 and 1 to that value. Then we format that pair of numbers with their sum and with decorations indicating the relevant arithmetic:

 

3=1+2

5=2+3

67=33+34

71=35+36

 

=={{header|jq}}==

and so a naive approach to computing the first 20 numbers satisfying

the condition is appropriate.

. as $n

| if ($n < 2) then false

| "\($i) + \($i + 1) = \($q)" );

 

{{out}}

<pre>

 

=={{header|Julia}}==

using Primes

 

println("Ten millionth: $i + $(i + 1) = $(i + i + 1)")

end

<pre>

1 + 2 = 3

 

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

{{out}}

<pre>1 + 2 = 3

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use ntheory 'is_prime';

 

my($n,$c);

{{out}}

<pre> 1 + 2 = 3

=={{header|Phix}}==

''Every'' prime p greater than 2 is odd, hence p/2 is k.5 and the adjacent numbers needed are k and k+1. DOH.

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

<span style="color: #008080;">procedure</span> <span style="color: #000000;">doh</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: #7060A8;">papply</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">get_primes</span><span style="color: #0000FF;">(-</span><span style="color: #000000;">21</span><span style="color: #0000FF;">)[</span><span style="color: #000000;">2</span><span style="color: #0000FF;">..$],</span><span style="color: #000000;">doh</span><span style="color: #0000FF;">)</span>

<span style="color: #000000;">doh</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">get_prime</span><span style="color: #0000FF;">(</span><span style="color: #000000;">1e7</span><span style="color: #0000FF;">+</span><span style="color: #000000;">1</span><span style="color: #0000FF;">))</span>

{{out}}

<pre>

 

=={{header|Python}}==

 

def isPrime(n):

print('{:2}'.format(n), "+", '{:2}'.format(n+1), "=", '{:2}'.format(suma))

else:

{{out}}

<pre>The first 20 pairs of numbers whose sum is prime:

 

=={{header|Raku}}==

 

my @wanted = @n-n1-triangular.grep: *.[2].is-prime;

 

{{out}}

<pre>

 

=={{header|Ring}}==

load "stdlibcore.ring"

see "working..." + nl

 

see "done..." + nl

{{out}}

<pre>

 

=={{header|Sidef}}==

.grep { .tail.is_prime })

 

wanted.first(20).each_2d {|a,b,c|

printf("%2d + %2d = %2d\n", a,b,c)

 

{{out}}

{{libheader|Wren-math}}

{{libheader|Wren-fmt}}

import "./fmt" for Fmt

 

var p = primes[1e7]

var hp = (p/2).floor

 

{{out}}

=={{header|XPL0}}==

{{trans|Ring}}

include xpllib;

int N, Num, Sum;

];

Text(0, "Done...^M^J");

 

{{out}}