Minimum primes: Difference between revisions
Realize in F#
(Added C# version, translation of Ring, solution #1) |
(Realize in F#) |
||
Line 122:
{{out}}
Same as Ring.
=={{header|F_Sharp|F#}}==
This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]
<lang fsharp>
// Minimum primes. Nigel Galloway: October 29th., 2021
let N1,N2,N3=[5;45;23;21;67],[43;22;78;46;38],[9;98;12;54;53]
let fN g=primes32()|>Seq.find((<=)g)
printfn "%A" (List.zip3 N1 N2 N3|>List.map(fun(n,g,l)->fN(max (max n g) l)))
</lang>
{{out}}
<pre>
[43; 101; 79; 59; 67]
</pre>
=={{header|Factor}}==
<lang factor>USING: arrays math math.primes prettyprint sequences ;
| |||