Find adjacent primes which differ by a square integer: Difference between revisions

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

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

<lang fsharp>

// Find adjacents primes which difference is square integer . Nigel Galloway: November 23rd., 2021

primes32()|>Seq.takeWhile((>)1000000)|>Seq.pairwise|>Seq.filter(fun(n,g)->let n=g-n in let g=(float>>sqrt>>int)n in g>6 && n=g*g)|>Seq.iter(printfn "%A")

</lang>

{{out}}

<pre>

(89689, 89753)

(107377, 107441)

(288583, 288647)

(367957, 368021)

(381103, 381167)

(396733, 396833)

(400759, 400823)

(445363, 445427)

(623107, 623171)

(625699, 625763)

(637003, 637067)

(710713, 710777)

(725209, 725273)

(779413, 779477)

(801883, 801947)

(803749, 803813)

(821677, 821741)

(832519, 832583)

(838249, 838349)

(844777, 844841)

(883807, 883871)

(912103, 912167)

(919447, 919511)

(954763, 954827)

(981823, 981887)

(997813, 997877)

</pre>