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

4
Task/Unprimeable-numbers/F-Sharp/unprimeable-numbers-1.fs Normal file
View file

@ -0,0 +1,4 @@
// Unprimeable numbers. Nigel Galloway: May 4th., 2021
let rec fN i g e l=seq{yield! [0..9]|>Seq.map(fun n->n*g+e+l); if g>1 then let g=g/10 in yield! fN(i+g*(e/g)) g (e%g) i}
let fG(n,g)=fN(n*(g/n)) n (g%n) 0|>Seq.exists(isPrime)
let uP()=let rec fN n g=seq{yield! {n..g-1}|>Seq.map(fun g->(n,g)); yield! fN(g)(g*10)} in fN 1 10|>Seq.filter(fG>>not)|>Seq.map snd

1
Task/Unprimeable-numbers/F-Sharp/unprimeable-numbers-2.fs Normal file
View file

@ -0,0 +1 @@
uP()|>Seq.take 35|>Seq.iter(printf "%d "); printfn ""

1
Task/Unprimeable-numbers/F-Sharp/unprimeable-numbers-3.fs Normal file
View file

@ -0,0 +1 @@
printfn "600th unprimable number is %d" (uP()|>Seq.item 599)

1
Task/Unprimeable-numbers/F-Sharp/unprimeable-numbers-4.fs Normal file
View file

@ -0,0 +1 @@
[0..9]|>Seq.iter(fun n->printfn "first umprimable number ending in %d is %d" n (uP()|>Seq.find(fun g->n=g%10)))

2
Task/Unprimeable-numbers/F-Sharp/unprimeable-numbers-5.fs Normal file
View file

@ -0,0 +1,2 @@
let uPx x=let rec fN n g=seq{yield! {n+x..10..g-1}|>Seq.map(fun g->(max 1 n,g)); yield! fN(g)(g*10)} in fN 0 10|>Seq.filter(fG>>not)|>Seq.map snd
[0..9]|>Seq.iter(fun n->printfn "first umprimable number ending in %d is %d" n (uPx n|>Seq.head))