Circular primes: Difference between revisions
Content added Content deleted
| Line 623: | Line 623: | ||
let circP()=seq{yield! [2;3;5;7]; yield! fN [1;3;7;9] 10} |
let circP()=seq{yield! [2;3;5;7]; yield! fN [1;3;7;9] 10} |
||
circP()|> Seq.take 19 |>Seq.iter(printf "%d "); printfn "" |
circP()|> Seq.take 19 |>Seq.iter(printf "%d "); printfn "" |
||
printf "The first 5 repunit primes are "; rUnitP |
printf "The first 5 repunit primes are "; rUnitP(10)|>Seq.take 5|>Seq.iter(fun n->printf $"R(%d{n}) "); printfn "" |
||
</lang> |
</lang> |
||
{{out}} |
{{out}} |
||