First 9 prime Fibonacci number: Difference between revisions
Content added Content deleted
(Added C++, Java and Rust solutions) |
m (→{{header|J}}: change verb tense -- while the technique we use is for generating fibonacci numbers, we use it to actually generate a few dozen) |
||
| Line 709: | Line 709: | ||
=={{header|J}}== |
=={{header|J}}== |
||
Here, we pick a convenient expression |
Here, we pick a convenient expression and [https://code.jsoftware.com/wiki/Essays/Fibonacci_Sequence generate fibonacci numbers] |
||
<lang J>fib=: <. 0.5 + (%:5) %~ (2 %~ 1+%:5)^i.63</lang> |
<lang J>fib=: <. 0.5 + (%:5) %~ (2 %~ 1+%:5)^i.63</lang> |
||