First 9 prime Fibonacci number: Difference between revisions
add Miranda
Hellangelx (talk | contribs) |
Not a robot (talk | contribs) (add Miranda) |
||
| (6 intermediate revisions by 4 users not shown) | |||
Line 45:
fib(47): 2971215073
</pre>
=={{header|ABC}}==
<syntaxhighlight lang="abc">HOW TO REPORT prime n:
REPORT n>=2 AND NO d IN {2..floor (root n)} HAS n mod d = 0
PUT 1, 1 IN a, b
PUT 0 IN n
WHILE n<9:
IF prime a:
WRITE a/
PUT n+1 IN n
PUT b, a+b IN a, b</syntaxhighlight>
{{out}}
<pre>2
3
5
13
89
233
1597
28657
514229</pre>
=={{header|Ada}}==
Line 445 ⟶ 467:
<syntaxhighlight lang="cpp">#include <chrono>
#include <iostream>
#include <utility>
#include <primesieve.hpp>
Line 497 ⟶ 518:
std::string to_string(const big_int& n) {
std::string str = n.get_str();
if (len > 40) {
str += " digits)";
}
return str;
Line 859 ⟶ 881:
28657
514229</pre>
=={{header|EasyLang}}==
<syntaxhighlight>
fastfunc isprim num .
i = 2
while i <= sqrt num
if num mod i = 0
return 0
.
i += 1
.
return 1
.
prev = 1
val = 1
while cnt < 9
h = prev + val
prev = val
val = h
if isprim val = 1
write val & " "
cnt += 1
.
.
</syntaxhighlight>
{{out}}
<pre>
2 3 5 13 89 233 1597 28657 514229
</pre>
=={{header|F_Sharp|F#}}==
Line 1,221 ⟶ 1,272:
25 F(9311) = 34232 … 76289 (1946 digits)
26 F(9677) = 10565 … 70357 (2023 digits)</pre>
=={{header|Miranda}}==
<syntaxhighlight lang="miranda">main :: [sys_message]
main = [(Stdout . lay . map show . take 9 . filter prime) fibo]
fibo :: [num]
fibo = 1 : 1 : [a + b | (a,b) <- zip2 fibo (tl fibo)]
prime :: num->bool
prime n = n=2 \/ n=3, if n<=4
prime n = False, if or [n mod 2=0, n mod 3=0]
prime n = and [n mod d ~= 0 | d <- [3, 5..entier (sqrt n)]]</syntaxhighlight>
{{out}}
<pre>2
3
5
13
89
233
1597
28657
514229</pre>
=={{header|Nim}}==
Line 1,710 ⟶ 1,783:
[2, 3, 5, 13, 89, 233, 1597, 28657, 514229]
</pre>
=={{header|SETL}}==
<syntaxhighlight lang="setl">program prime_fibonacci;
[a, b] := [1, 1];
loop until seen = 9 do
if prime a then
print(a);
seen +:= 1;
end if;
[a, b] := [b, a+b];
end loop;
op prime(n);
if n<=4 then
return n in {2, 3};
end if;
if n mod 2 = 0 or n mod 3 = 0 then
return false;
end if;
d := 5;
loop while d*d <= n do
if n mod d = 0 then return false; end if;
d +:= 2;
if n mod d = 0 then return false; end if;
d +:= 4;
end loop;
return true;
end op;
end program;</syntaxhighlight>
{{out}}
<pre>2
3
5
13
89
233
1597
28657
514229</pre>
=={{header|Sidef}}==
Line 1,720 ⟶ 1,832:
=={{header|Wren}}==
{{libheader|Wren-math}}
<syntaxhighlight lang="
var limit = 11 // as far as we can go without using BigInt
| |||