Next special primes: Difference between revisions

{{trans|FreeBASIC}}

 

I a == 2

R 1B

p += i

print(p, end' ‘ ’)

 

{{out}}

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

{{libheader|Action! Sieve of Eratosthenes}}

 

PROC Main()

OD

PrintF("%E%EThere are %I next special primes",count)

{{out}}

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

 

=={{header|ALGOL W}}==

% the gap between previus primes and the current %

% sets p( 1 :: n ) to a sieve of primes up to n %

end while_thisPrime_lt_MAX_NUMBER

end

{{out}}

<pre>

=={{header|Arturo}}==

 

lim: 1050

lastP: 3

 

print "List of next special primes less than 1050:"

 

{{out}}

 

=={{header|AWK}}==

# syntax: GAWK -f NEXT_SPECIAL_PRIMES.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

=={{header|BASIC}}==

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

if v < 2 then return False

if v mod 2 = 0 then return v = 2

i += 2

until p + i >= 1050

 

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

If v <= 1 : ProcedureReturn #False

ElseIf v < 4 : ProcedureReturn #True

Until p + i >= 1050

Input()

 

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

if v < 2 then return False : fi

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

i = i + 2

until p + i >= 1050

 

 

=={{header|C}}==

#include <stdbool.h>

 

}

}

 

{{out}}

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

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

// Next special primes. Nigel Galloway: March 26th., 2021

let mP=let mutable n,g=2,0 in primes32()|>Seq.choose(fun y->match y-n>g,n with (true,i)->g<-y-n; n<-y; Some(i,g,y) |_->None)

mP|>Seq.takeWhile(fun(_,_,n)->n<1050)|>Seq.iteri(fun i (n,g,l)->printfn "n%d=%d n%d=%d n%d-n%d=%d" i n (i+1) l (i+1) i g)

{{out}}

<pre>

 

Here's another way of writing the mP sequence above which is (hopefully) a little clearer:

let mP = seq {

let mutable prevp, maxdiff = 2, 0

prevp <- p

}

 

=={{header|Factor}}==

{{works with|Factor|0.98}}

 

"2 " write 1 3

[ dup 1050 < ] [

2dup "(%d) %d " printf [ + next-prime ] keep 2dup - nip swap

{{out}}

<pre>

 

=={{header|FreeBASIC}}==

 

dim as integer p = 3, i = 2

end if

i += 2

{{out}}<pre>2 3 5 11 19 29 41 59 79 101 127 157 191 227 269 313 359 409 461 521 587 659 733 809 887 967 1049</pre>

 

=={{header|Go}}==

 

import "fmt"

}

}

 

{{out}}

=={{header|Java}}==

{{trans|C}}

private static boolean isPrime(int n) {

if (n < 2) return false;

}

}

 

{{out}}

 

This entry uses `is_primes` as can be defined as in [[Erd%C5%91s-primes#jq]].

def primes:

2, (range(3;infinite;2) | select(is_prime));

# The task

# The following assumesg invocation with the -n option:

{{out}}

Invocation example: jq -n -f program.jq

 

=={{header|Julia}}==

 

let

end

end

<pre>

Special primes under 1050:

 

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

n = {2, 3};

Do[

{i, Max[n] + 1, max}

]

{{out}}

<pre>{2, 3, 5, 11, 19, 29, 41, 59, 79, 101, 127, 157, 191, 227, 269, 313, 359, 409, 461, 521, 587, 659, 733, 809, 887, 967, 1049}</pre>

 

=={{header|Nim}}==

 

func isPrime(n: Positive): bool =

let list = collect(newSeq, for p in nextSpecialPrimes(1050): p)

echo "List of next special primes less than 1050:"

 

{{out}}

just showing the small difference to increasing prime gaps.<BR>LastPrime is updated outside or inside If

 

program NextSpecialprimes;

//increasing prime gaps see

writeln;

NextSpecial;

{{out}}

<pre>

=={{header|Perl}}==

{{libheader|ntheory}}

use warnings;

use feature <state say>;

 

pop @specials;

{{out}}

<pre> 2 0

 

=={{header|Phix}}==

<span style="color: #004080;">integer</span> <span style="color: #000000;">lastSpecial</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">3</span><span style="color: #0000FF;">,</span> <span style="color: #000000;">lastGap</span> <span style="color: #0000FF;">=</span> <span style="color: #000000;">1</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;">"Special primes under 1,050:\n"</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|Python}}==

 

def isPrime(n):

i += 2

if p + i >= 1050:

 

 

=={{header|Raku}}==

state @primes = grep *.is-prime, 2..*;

shift @primes while @primes[0] <= $previous + $gap;

my $limit = @specials.first: :k, *.[0] > 1050;

 

{{out}}

<pre>

=={{header|REXX}}==

{{trans|RING}}

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

if hi=='' | hi=="," then hi= 1050 /* " " " " " " */

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 nl + "done..." + nl

 

{{out}}

<pre>

 

=={{header|Sidef}}==

 

var gap = 0

special_primes(1050).each_2d {|p,gap|

say "#{'%4s' % p} #{'%4s' % gap}"

{{out}}

<pre>

{{libheader|Wren-math}}

{{libheader|Wren-fmt}}

import "/fmt" for Fmt

 

lastSpecial = p

}

 

{{out}}