Find squares n where n+1 is prime: Difference between revisions
Find squares n where n+1 is prime (view source)
Revision as of 13:18, 17 December 2021
, 2 years agoRealize in F#
m (→{{header|Phix}}: slightly better english) |
(Realize in F#) |
||
Line 23:
</pre>
=={{header|F_Sharp|F#}}==
This task uses [http://www.rosettacode.org/wiki/Extensible_prime_generator#The_functions Extensible Prime Generator (F#)]
<lang fsharp>
// Find squares n where n+1 is prime. Nigel Galloway: December 17th., 2021
seq{yield 1; for g in 2..2..30 do let n=g*g in if isPrime(n+1) then yield n}|>Seq.iter(printf "%d "); printfn ""
</lang>
{{out}}
<pre>
1 4 16 36 100 196 256 400 576 676
</pre>
=={{header|Fermat}}==
<lang fermat>!!1;
| |||