The challenge is rather simple:
- Take a positive whole number
- Output the
nth Fibonacci prime number.
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.