First 9 prime Fibonacci number: Difference between revisions

Content added Content deleted

Inline

@@ Line 965: / Line 965: @@
 : fib(9677) = 10565977873308861656...95169792504550670357 (2,023 digits) (3 minutes and 3s)
 </pre>
+=={{header|Pike}}==
+{{trans|C}}
+<lang Pike>bool isPrime(int n) {
+	if (n < 2) {
+		return false;
+	}
+	if (!(n%2)) {
+		return n == 2;
+	}
+	if (!(n%3)) {
+		return n == 3;
+	}
+	int d = 5;
+	while(d*d <= n) {
+		if (!(n%d)) {
+			return false;
+		}
+		d += 2;
+		if (!(n%d)) {
+			return false;
+		}
+		d += 4;
+	 }
+	return true;
+}
+int main() {
+	int limit = 12;
+	write("The first " + (string)limit + " prime Fibonacci numbers are:\n");
+	int count = 0;
+	int f1, f2;
+	f1 = f2 = 1;
+	while(count < limit) {
+		int f3 = f2 + f1;
+		if (isPrime(f3)) {
+			write((string)f3 + " ");
+			count = count + 1;
+		}
+		f1 = f2;
+		f2 = f3;
+	}
+	write("\n");
+	return 0;
+}</lang>
+{{out}}
+<pre>The first 12 prime Fibonacci numbers are:
+3 5 13 89 233 1597 28657 514229 433494437 2971215073 99194853094755497</pre>
 =={{header|Python}}==