The challenge is rather simple:
- Take a positive whole number \$n\$ as input.
- Output the \$n\$th Fibonacci prime number, i.e. the \$n\$th Fibonacci number that is also prime.
Input can be as an parameter to a function (and the output will be the return value), or can be taken from the command line (and outputted there).
Note: Using built in prime checking functions or Fibonacci series generators is not allowed.
The first 10 Fibonacci primes are
[2, 3, 5, 13, 89, 233, 1597, 28657, 514229, 433494437]
Shortest code wins. Good luck!