Minimum primes: Difference between revisions
Content added Content deleted
m (→{{header|Ring}}: simplified nxtPrime()) |
|||
Line 136: | Line 136: | ||
<pre> |
<pre> |
||
[43 101 79 59 67] |
[43 101 79 59 67] |
||
</pre> |
|||
=={{header|jq}}== |
|||
{{works with|jq}} |
|||
'''Works with gojq, the Go implementation of jq''' |
|||
This entry uses `is_prime` as defined, for example, at [[Erd%C5%91s-primes#jq]]. |
|||
Two solutions are presented following these preliminaries: |
|||
<lang jq> |
|||
include "is_prime"; # reminder |
|||
def Numbers1: [5,45,23,21,67]; |
|||
def Numbers2: [43,22,78,46,38]; |
|||
def Numbers3: [9,98,12,54,53]; |
|||
# Generate primes in range(m;n) provided m>=2 |
|||
def primes(m; n): |
|||
if m%2 == 0 then primes(m+1;n) |
|||
else range(m; n; 2) | select(is_prime) |
|||
end;</lang> |
|||
'''Explicit Iteration''' |
|||
<lang jq>[range(0;5) |
|||
| [Numbers1[.], Numbers2[.], Numbers3[.]] | max |
|||
| first(primes(.; infinite))]</lang> |
|||
'''Functional''' |
|||
<lang jq>[Numbers1, Numbers2, Numbers3] |
|||
| transpose |
|||
| [map(max | first(primes(.; infinite)))] </lang> |
|||
{{out}} |
|||
<pre> |
|||
[43,101,79,59,67] |
|||
</pre> |
</pre> |
||