aparler/RosettaCodeData
1
0
Fork 0
Code Issues 12 Pull requests 3 Projects Releases Packages Wiki Activity Actions

Data commit

Browse source
This commit is contained in:
Ingy döt Net 2023-07-01 11:58:00 -04:00
parent 7387c8f97b
commit cb5bb5e222
199093 changed files with 3378972 additions and 0 deletions
Download patch file Download diff file Expand all files Collapse all files

5
Task/Emirp-primes/F-Sharp/emirp-primes-1.fs Normal file
View file

@ -0,0 +1,5 @@
// Generate emirps. Nigel Galloway: November 19th., 2017
let emirp =
let rec fN n g = match n with |0->g |_->fN (n/10) (g*10+n%10)
let fG n g = n<>g && isPrime g
primes32() |> Seq.filter (fun n -> fG n (fN n 0))

1
Task/Emirp-primes/F-Sharp/emirp-primes-2.fs Normal file
View file

@ -0,0 +1 @@
emirps |> (Seq.take 20) |> Seq.iter (printf "%d ")

1
Task/Emirp-primes/F-Sharp/emirp-primes-3.fs Normal file
View file

@ -0,0 +1 @@
emirps |> Seq.skipWhile (fun n->n<7700) |> Seq.takeWhile (fun n->n<=8000) |> Seq.iter (printf "%d ")

1
Task/Emirp-primes/F-Sharp/emirp-primes-4.fs Normal file
View file

@ -0,0 +1 @@
printfn "%d" (Seq.item 9999 emirps)

8
Task/Emirp-primes/F-Sharp/emirp-primes-5.fs Normal file
View file

@ -0,0 +1,8 @@
// count # of emirps with n = 2 to 7 digits. Nigel Galloway: August 8th., 2018
let n=emirp |> Seq.takeWhile(fun n->n<10000000) |> Seq.countBy(fun n->match n with |n when n>999999->7
|n when n> 99999->6
|n when n> 9999->5
|n when n> 999->4
|n when n> 99->3
|_ ->2)
for n,g in n do printfn "%d -> %d" n g