First 9 prime Fibonacci number: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,710: / Line 1,710: @@
 [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
+</pre>
 =={{header|Sidef}}==