Largest difference between adjacent primes: Difference between revisions

 

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

V is_prime = [0B] * 2 [+] [1B] * (limit - 1)

L(n) 0 .< Int(limit ^ 0.5 + 1.5)

maxdiff = max(maxdiff, primes[n] - primes[n - 1])

 

 

{{out}}

As with the Wren, Phix, etc. samples, shows the gaps at a few other places.

{{libheader|ALGOL 68-primes}}

PR read "primes.incl.a68" PR

[]BOOL prime = PRIMESIEVE 10 000 000; # sieve the primes to 10 000 000 #

FI

OD

{{out}}

<pre>

 

=={{header|AWK}}==

# syntax: GAWK -f LARGEST_DIFFERENCE_BETWEEN_ADJACENT_PRIMES.AWK

# converted from FreeBASIC

return(1)

}

{{out}}

<pre>

=={{header|C}}==

{{trans|FreeBASIC}}

#include<stdlib.h>

 

printf( "The largest difference was %d, between %d and %d.\n", record, champ, champj );

return 0;

{{out}}<pre>The largest difference was 114, between 492113 and 492227.</pre>

 

=={{header|C++}}==

{{libheader|Primesieve}}

#include <locale>

 

p1 = p2;

}

 

{{out}}

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

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

// Largest difference between adjacent primes. Nigel Galloway: November 22nd., 2021

let n,g=primes32()|>Seq.takeWhile((>)1000000)|>Seq.pairwise|>Seq.maxBy(fun(n,g)->g-n) in printfn $"%d{g}-%d{n}=%d{g-n}"

{{out}}

<pre>

See [[Largest difference between adjacent primes/Factor]] for a detailed explanation because why not?

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

math.primes.lists sequences ;

 

[ second 1e6 < ] lwhile { 0 } [ max ] foldl

 

{{out}}

<pre>

 

=={{header|FreeBASIC}}==

 

function nextprime( n as uinteger ) as uinteger

wend

 

{{out}}<pre>The largest difference was 114 between 492113 and 492227</pre>

 

{{trans|Wren}}

{{libheader|go-rcu}}

 

import (

}

}

 

{{out}}

 

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

20 GOSUB 190

30 IF P2>1000000! THEN GOTO 70

280 C2 = P2

290 R = P2 - P

 

=={{header|jq}}==

See [[Erdős-primes#jq]] for a suitable definition of `is_prime` as used here.

 

def primes:

(. // infinite) as $n

 

pow(10; 1, 2, 6) | largest_difference_between_adjacent_primes

{{out}}

<pre>

 

=={{header|Julia}}==

 

function maxprimeinterval(nmax)

 

foreach(n -> maxprimeinterval(10^n), 1:10)

<pre>

The maximum prime interval in primes up to 10 is 2: for example at [3, 5].

</pre>

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

 

{{out}}<pre>

=={{header|Pascal}}==

==={{header|Free Pascal}}===

// sieving small ranges of 65536 only odd numbers

//{$O+,R+}

{$ENDIF}

end.

{{out|@TIO.RUN}}

<pre>

 

=={{header|Perl}}==

use warnings;

use Primesieve qw(generate_primes);

map { ($diff = $primes[$_] - $primes[$_-1]) > $max and ($max,$p) = ($diff,$_-1) } 1..$#primes;

printf "Largest prime gap up to %d: %d - between %d and %d.\n", 10**$n, $max, @primes[$p,$p+1];

{{out}}

<pre>Largest prime gap up to 100: 8 - between 89 and 97.

=={{header|Phix}}==

{{trans|Wren}}

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

<span style="color: #004080;">atom</span> <span style="color: #000000;">t0</span> <span style="color: #0000FF;">=</span> <span style="color: #7060A8;">time</span><span style="color: #0000FF;">()</span>

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

<span style="color: #0000FF;">?</span><span style="color: #7060A8;">elapsed</span><span style="color: #0000FF;">(</span><span style="color: #7060A8;">time</span><span style="color: #0000FF;">()-</span><span style="color: #000000;">t0</span><span style="color: #0000FF;">)</span>

{{out}}

<pre>

 

=={{header|Python}}==

print("working...")

limit = 1000000

print(diff)

print("done...")

{{out}}

<pre>

=={{header|Raku}}==

===Built-ins===

printf "Largest prime gap up to {10 ** $n}: %d - between %d and %d.\n", .[0], |.[1]

given max (^10**$n).grep(&is-prime).rotor(2=>-1).map({.[1]-.[0],$_})

{{out}}

<pre>Largest prime gap up to 100: 8 - between 89 and 97.

===Module===

 

my $sieve = Math::Primesieve.new;

 

printf "Largest prime gap up to {10 ** $n}: %d - between %d and %d.\n", .[0], |.[1]

given max $sieve.primes(10 ** $n).rotor(2=>-1).map({.[1]-.[0],$_})

Same output

 

=={{header|Ring}}==

 

load "stdlib.ring"

see "working..." + nl

see nl + "Largest difference is = " + diff + nl

see "done..." + nl

{{out}}

<pre>

 

=={{header|Sidef}}==

 

var gaps = []

printf("Largest prime gap up to 10^%s is %3s between %s and %s\n",

n, b.next_prime - b, b, b.next_prime)

{{out}}

<pre>

{{libheader|Wren-math}}

{{libheader|Wren-fmt}}

import "/fmt" for Fmt

 

nextStop = nextStop * 10

}

 

{{out}}

 

=={{header|XPL0}}==

int Prime, I, K;

char Flags;

Limit:= Limit*10;

];

 

{{out}}