First 9 prime Fibonacci number: Difference between revisions
→{{header|Perl}}
(+add Pike) |
|||
Line 892:
println(take(9, primefibs)) # List: (2 3 5 13 89 233 1597 28657 514229)
</lang>
=={{header|Mathematica}}/{{header|Wolfram Language}}==
First solution by guessing some upper bound:
<lang Mathematica>Select[Fibonacci /@ Range[100], PrimeQ, 9]</lang>
{{out}}
<pre>{2, 3, 5, 13, 89, 233, 1597, 28657, 514229}</pre>
Second solution without guessing some upper bound:
<lang Mathematica>list = {};
Do[
f = Fibonacci[i];
If[PrimeQ[f],
AppendTo[list, {i, f}];
If[Length[list] >= 26, Break[]]
]
,
{i, 1, \[Infinity]}
];
out=Row[{"F(",#1,") = ",If[IntegerLength[#2]<=10,#2,Row@Catenate[{Take[IntegerDigits[#2],5],{" \[Ellipsis] "},Take[IntegerDigits[#2],-5],{" (",IntegerLength[#2]," digits)"}}]]}]&@@@list;
TableForm[out,TableHeadings->{Automatic,None}]</lang>
{{out}}
<pre>1 F(3) = 2
2 F(4) = 3
3 F(5) = 5
4 F(7) = 13
5 F(11) = 89
6 F(13) = 233
7 F(17) = 1597
8 F(23) = 28657
9 F(29) = 514229
10 F(43) = 433494437
11 F(47) = 2971215073
12 F(83) = 99194 … 55497 (17 digits)
13 F(131) = 10663 … 72169 (28 digits)
14 F(137) = 19134 … 23917 (29 digits)
15 F(359) = 47542 … 76241 (75 digits)
16 F(431) = 52989 … 62369 (90 digits)
17 F(433) = 13872 … 68353 (91 digits)
18 F(449) = 30617 … 65949 (94 digits)
19 F(509) = 10597 … 29909 (107 digits)
20 F(569) = 36684 … 65869 (119 digits)
21 F(571) = 96041 … 74629 (119 digits)
22 F(2971) = 35710 … 16229 (621 digits)
23 F(4723) = 50019 … 91957 (987 digits)
24 F(5387) = 29304 … 55833 (1126 digits)
25 F(9311) = 34232 … 76289 (1946 digits)
26 F(9677) = 10565 … 70357 (2023 digits)</pre>
=={{header|Perl}}==
| |||