Ramanujan primes/twins

From Rosetta Code
Revision as of 13:32, 9 September 2021 by Nigel Galloway (talk | contribs) (Realize in F#)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

{draft task} In a manner similar to twin primes, twin Ramanujan primes may be explored. The task is to determine how many of the first million Ramanujan primes are twins.

Related Task
Twin primes

F#

This task uses Ramanujan primes (F#) <lang fsharp> // Twin Ramanujan primes. Nigel Galloway: September 9th., 2021 printfn $"There are %d{rP 1000000|>Seq.pairwise|>Seq.filter(fun(n,g)->n=g-2)|>Seq.length} twins in the first million Ramanujan primes" </lang>

Output:
There are 74973 twins in the first million Ramanujan primes