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

6
Task/Long-primes/F-Sharp/long-primes-1.fs Normal file
View file

@ -0,0 +1,6 @@
// Return true if prime n is a long prime. Nigel Galloway: September 25th., 2018
let fN n g = let rec fN i g e l = match e with | 0UL -> i
| _ when e%2UL = 1UL -> fN ((i*g)%l) ((g*g)%l) (e/2UL) l
| _ -> fN i ((g*g)%l) (e/2UL) l
fN 1UL 10UL (uint64 g) (uint64 n)
let isLongPrime n=Seq.length (factors (n-1) |> Seq.filter(fun g->(fN n g)=1UL))=1

1
Task/Long-primes/F-Sharp/long-primes-10.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 64000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<64000) |> Seq.filter isLongPrime|> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-11.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 128000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<128000) |> Seq.filter isLongPrime|> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-12.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 256000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<256000) |> Seq.filter isLongPrime|> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-13.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 512000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<512000) |> Seq.filter isLongPrime|> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-14.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 1024000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<1024000) |> Seq.filter isLongPrime|> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-2.fs Normal file
View file

@ -0,0 +1 @@
primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<500) |> Seq.filter isLongPrime |> Seq.iter(printf "%d ")

1
Task/Long-primes/F-Sharp/long-primes-3.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 500" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<500) |> Seq.filter isLongPrime |> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-4.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 1000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<1000) |> Seq.filter isLongPrime |> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-5.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 2000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<2000) |> Seq.filter isLongPrime |> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-6.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 4000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<4000) |> Seq.filter isLongPrime|> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-7.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 8000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<8000) |> Seq.filter isLongPrime |> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-8.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 16000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<16000) |> Seq.filter isLongPrime |> Seq.length)

1
Task/Long-primes/F-Sharp/long-primes-9.fs Normal file
View file

@ -0,0 +1 @@
printfn "There are %d long primes less than 32000" (primes |> Seq.skip 3 |> Seq.takeWhile(fun n->n<32000) |> Seq.filter isLongPrime |> Seq.length)