First 9 prime Fibonacci number: Difference between revisions
→{{header|jq}}
No edit summary |
|||
Line 46:
The first 12 prime Fibonacci numbers are:
2 3 5 13 89 233 1597 28657 514229 433494437 2971215073 99194853094755497
</pre>
=={{header|jq}}==
'''Works with [[jq]]''' (*)
'''Works with gojq, the Go implementation of jq'''
See [[Erdős-primes#jq]] for a suitable definition of `is_prime` as
used here.
(*) For unlimited precision integer arithmetic, use gojq.
<lang jq># Emit an unbounded stream of Fibonacci numbers
def fibonaccis:
# input: [f(i-2), f(i-1)]
def fib: (.[0] + .[1]) as $sum
| if .[2] == 0 then $sum
else $sum, ([ .[1], $sum ] | fib)
end;
[-1, 1] | fib;
"The first 9 prime Fibonacci numbers are:",
limit(9; fibonaccis | select(is_prime))</lang>
{{out}}
<pre>
The first 9 prime Fibonacci numbers are:
2
3
5
13
89
233
1597
28657
514229
</pre>
| |||