First 9 prime Fibonacci number: Difference between revisions

=={{header|Ada}}==

procedure Prime_Fibonacci is

end if;

end loop;

{{out}}

<pre>

=={{header|ALGOL 68}}==

{{libheader|ALGOL 68-primes}}

PR read "primes.incl.a68" PR # include prime utilities #

INT p count := 0;

FI

OD

{{out}}

<pre>

=={{header|ALGOL W}}==

% -- returns true if n is prime, false otherwise - uses trial division %

end while_pCount_lt_9

end task

{{out}}

<pre>

=={{header|AWK}}==

# syntax: GAWK -f FIRST_9_PRIME_FIBONACCI_NUMBER.AWK

BEGIN {

return(1)

}

{{out}}

<pre>

=={{header|BASIC}}==

==={{header|BASIC256}}===

if v < 2 then return False

if v mod 2 = 0 then return v = 2

end if

end while

{{out}}

<pre>

==={{header|FreeBASIC}}===

If ValorEval <= 1 Then Return False

For i As Integer = 2 To Int(Sqr(ValorEval))

End If

Loop

{{out}}

<pre>The first 9 Prime Fibonacci numbers:

==={{header|PureBasic}}===

If v <= 1 : ProcedureReturn #False

ElseIf v < 4 : ProcedureReturn #True

PrintN(#CRLF$ + "--- terminado, pulsa RETURN---"): Input()

CloseConsole()

{{out}}

<pre>

==={{header|Yabasic}}===

if v < 2 then return False : fi

if mod(v, 2) = 0 then return v = 2 : fi

end if

loop

{{out}}

<pre>

{{trans|Wren}}

Requires C99 or later.

#include <stdint.h>

#include <stdbool.h>

printf("\n");

return 0;

{{out}}

{{libheader|GMP}}

{{libheader|Primesieve}}

#include <iostream>

#include <sstream>

std::chrono::duration<double> ms(finish - start);

std::cout << "elapsed time: " << ms.count() << " seconds\n";

{{out}}

=={{header|CLU}}==

a: int := 1

b: int := 1

end

end

{{out}}

<pre>2

=={{header|COBOL}}==

PROGRAM-ID. PRIME-FIBONACCI.

IF FIB IS EQUAL TO 2 OR 3, MOVE 'X' TO PRIME-FLAG.

DONE.

{{out}}

<pre> 2

=={{header|Comal}}==

0020 IF n<4 THEN RETURN n=2 OR n=3

0030 IF n MOD 2=0 OR n MOD 3=0 THEN RETURN FALSE

0210 c:=a+b;a:=b;b:=c

0220 ENDWHILE

{{out}}

<pre>

=={{header|Cowgol}}==

sub prime(n: uint32): (p: uint8) is

a := b;

b := c;

{{out}}

<pre>2

=={{header|Draco}}==

bool comp;

ulong d;

b := c

od

{{out}}

<pre>2

=={{header|F_Sharp|F#}}==

// Prime Fibonacci Numbers. Nigel Galloway: January 21st., 2022

seq{yield! [2I;3I]; yield! MathNet.Numerics.Generate.FibonacciSequence()|>Seq.skip 5|>Seq.filter(fun n->n%4I=1I && Open.Numeric.Primes.MillerRabin.IsProbablePrime &n)}|>Seq.take 23|>Seq.iteri(fun n g->printfn "%2d->%A" (n+1) g)

{{out}}

<pre>

=={{header|Factor}}==

{{works with|Factor|0.99 2021-06-02}}

: prime-fib ( -- list )

[ second ] lmap-lazy [ prime? ] lfilter ;

{{out}}

<pre>

=={{header|Go}}==

{{trans|C}}

import "fmt"

}

fmt.Println()

{{out}}

Here, we pick a convenient expression and [https://code.jsoftware.com/wiki/Essays/Fibonacci_Sequence generate fibonacci numbers]

Then we select the first 9 which are prime:

=={{header|jq}}==

(*) For unlimited precision integer arithmetic, use gojq.

def fibonaccis:

# input: [f(i-2), f(i-1)]

"The first 9 prime Fibonacci numbers are:",

{{out}}

<pre>

=={{header|Java}}==

Uses the PrimeGenerator class from [[Extensible prime generator#Java]].

public class PrimeFibonacciGenerator {

return str;

}

{{out}}

=={{header|Julia}}==

using Primes

println(take(9, primefibs)) # List: (2 3 5 13 89 233 1597 28657 514229)

=={{header|Mathematica}}/{{header|Wolfram Language}}==

First solution by guessing some upper bound:

{{out}}

<pre>{2, 3, 5, 13, 89, 233, 1597, 28657, 514229}</pre>

Second solution without guessing some upper bound:

Do[

f = Fibonacci[i];

];

out=Row[{"F(",#1,") = ",If[IntegerLength[#2]<=10,#2,Row@Catenate[{Take[IntegerDigits[#2],5],{" \[Ellipsis] "},Take[IntegerDigits[#2],-5],{" (",IntegerLength[#2]," digits)"}}]]}]&@@@list;

{{out}}

<pre>1 F(3) = 2

=={{header|Perl}}==

use strict; # https://rosettacode.org/wiki/First_9_Prime_Fibonacci_Number

is_prime( $x ) and push @first, $x;

}

{{out}}

<pre>

{{libheader|Phix/online}}

You can run this online [http://phix.x10.mx/p2js/primefib.htm here].

<span style="color: #008080;">with</span> <span style="color: #008080;">javascript_semantics</span>

<span style="color: #008080;">include</span> <span style="color: #004080;">mpfr</span><span style="color: #0000FF;">.</span><span style="color: #000000;">e</span>

<span style="color: #000000;">n</span> <span style="color: #0000FF;">+=</span> <span style="color: #000000;">1</span>

<span style="color: #008080;">end</span> <span style="color: #008080;">while</span>

{{out}}

<pre>

=={{header|Pike}}==

{{trans|C}}

if (n < 2) {

return false;

write("\n");

return 0;

{{out}}

<pre>The first 12 prime Fibonacci numbers are:

=={{header|Python}}==

print("working...")

print("The firsr 9 Prime Fibonacci numbers:")

print()

print("done...")

{{out}}

<pre>

=={{header|Raku}}==

{{out}}

<pre> 1: 2

=={{header|Ring}}==

load "stdlibcore.ring"

see "working..." + nl

if nr = 1 return 1 ok

if nr > 1 return fib(nr-1) + fib(nr-2) ok

{{out}}

<pre>

=={{header|Rust}}==

// rug = "1.15.0"

// primal = "0.3"

let time = now.elapsed();

println!("elapsed time: {} milliseconds", time.as_millis());

{{out}}

=={{header|Sidef}}==

{{out}}

<pre>

=={{header|Wren}}==

{{libheader|Wren-math}}

var limit = 11 // as far as we can go without using BigInt

f2 = f3

}

{{out}}

=={{header|XPL0}}==

int N, I;

[if N <= 2 then return N = 2;

N:= F;

];

{{out}}