Safe and Sophie Germain primes: Difference between revisions

=={{header|11l}}==

I a == 2

R 1B

I ++cnt == 50

L.break

{{out}}

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

{{libheader|ALGOL 68-primes}}

PR read "primes.incl.a68" PR

[]BOOL prime = PRIMESIEVE 10 000; # hopefully, enough primes #

FI

OD

{{out}}

<pre>

=={{header|Arturo}}==

and? [prime? p][prime? 1 + 2*p]

]

loop split.every:10 sophieGermaines 'a ->

{{out}}

=={{header|AWK}}==

# syntax: GAWK -f SAFE_AND_SOPHIE_GERMAIN_PRIMES.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2022-04-03}}

{{out}}

<pre>

=={{header|Fermat}}==

n:=3;

!!2;

fi;

n:+2;

=={{header|BASIC}}==

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

if n < 2 then return false

if n < 4 then return true

if c mod 10 = 0 then print

end if

{{out}}<pre>2 3 5 11 23 29 41 53 83 89

113 131 173 179 191 233 239 251 281 293

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

20 C = 1

30 N = 3

270 WEND

280 Z = 1

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

if v < 2 then return False

if v mod 2 = 0 then return v = 2

end if

end while

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

If v <= 1 : ProcedureReturn #False

ElseIf v < 4 : ProcedureReturn #True

Wend

Input()

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

if v < 2 then return False : fi

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

endif

wend

=={{header|Go}}==

{{trans|Wren}}

{{libheader|Go-rcu}}

import (

}

}

{{out}}

See e.g. [[Find_adjacent_primes_which_differ_by_a_square_integer#jq]]

for suitable implementions of `is_prime/0` and `primes/0` as used here.

{{out}}

<pre>

=={{header|Julia}}==

for (i, p) in enumerate(filter(x -> isprime(2x + 1), primes(1500)))

print(lpad(p, 5), i % 10 == 0 ? "\n" : "")

end

<pre>

2 3 5 11 23 29 41 53 83 89

</pre>

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

NestWhile[NextPrime, n + 1, ! (PrimeQ[2 # + 1] && PrimeQ[#]) &]

Labeled[Grid[Partition[NestList[nextSafe, 2, 49], 10],

Alignment -> {Right,

{{out}}<pre>

=={{header|PARI/GP}}==

c = 0

n = 2

=={{header|Perl}}==

{{libheader|ntheory}}

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

my @want;

forprimes { is_prime(2 * $_ + 1) and (50 == push @want, $_)

{{out}}

<pre>

=={{header|Phix}}==

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

<span style="color: #008080;">function</span> <span style="color: #000000;">sophie_germain</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: #008080;">end</span> <span style="color: #008080;">while</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;">"First 50: %s\n"</span><span style="color: #0000FF;">,{</span><span style="color: #7060A8;">join</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">shorten</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">apply</span><span style="color: #0000FF;">(</span><span style="color: #000000;">res</span><span style="color: #0000FF;">,</span><span style="color: #7060A8;">sprint</span><span style="color: #0000FF;">),</span><span style="color: #008000;">""</span><span style="color: #0000FF;">,</span><span style="color: #000000;">5</span><span style="color: #0000FF;">))})</span>

{{out}}

<pre>

=={{header|Python}}==

print("working...")

row = 0

print(Sophie)

print("done...")

{{out}}

<pre>

=={{header|Raku}}==

{{out}}

<pre> 2 3 5 11 23 29 41 53 83 89

=={{header|Ring}}==

load "stdlib.ring"

see "working..." +nl

see "done..." + nl

{{out}}

<pre>

=={{header|Sidef}}==

.join(', ').say

{{out}}

<pre>

{{libheader|Wren-seq}}

{{libheader|Wren-fmt}}

import "./seq" for Lst

import "./fmt" for Fmt

}

System.print("The first 50 Sophie Germain primes are:")

{{out}}

=={{header|XPL0}}==

int N, I;

[for I:= 2 to sqrt(N) do

N:= N+1;

until Count >= 50;

{{out}}