Sum of two adjacent numbers are primes: Difference between revisions
Sum of two adjacent numbers are primes (view source)
Revision as of 09:49, 22 January 2022
, 2 years agoRealize in F#
m (julia example) |
(Realize in F#) |
||
Line 64:
</pre>
=={{header|F_Sharp|F#}}==
This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]
<lang fsharp>
// 2n+1 is prime. Nigel Galloway: Januuary 22nd., 2022
primes32()|>Seq.skip 1|>Seq.take 20|>Seq.map(fun n->n/2)|>Seq.iteri(fun n g->printfn "%2d: %2d + %2d=%d" (n+1) g (g+1) (g+g+1))
</lang>
{{out}}
<pre>
1: 1 + 2=3
2: 2 + 3=5
3: 3 + 4=7
4: 5 + 6=11
5: 6 + 7=13
6: 8 + 9=17
7: 9 + 10=19
8: 11 + 12=23
9: 14 + 15=29
10: 15 + 16=31
11: 18 + 19=37
12: 20 + 21=41
13: 21 + 22=43
14: 23 + 24=47
15: 26 + 27=53
16: 29 + 30=59
17: 30 + 31=61
18: 33 + 34=67
19: 35 + 36=71
20: 36 + 37=73
</pre>
=={{header|Julia}}==
<lang julia>using Lazy
| |||