Check whether a given number is Fibonacci prime or not.

PROCEDURE:-

1.input an integer n

2. first check whether it is prime or not

3. if it prime check whether it is in the Fibonacci series

4.the above check can be made by generating series and comparing each number with n

5.if n is found in the series then n is Fibonacci prime

6.else it is not Fibonacci prime  

CODE:-
#include<stdio.h>
void main(){
int n,i=2,k=0,a,b,i,m;
printf(“enter the number”);
scanf(“%d”,&n);
while(i<=n/2)
{
if(n%i = = 0)
  {
    k=1; break;
  }
i++;
}
if(k!=1)
{
a=0; b=1; i=1; m=n;
while(i<=m)
{
  c=a+b;
   if(m= =c)
    {
     printf(“ %d is Fibonacci prime”,n);    break;
    }
a=b; b=c; i++;
}
if(m!=c)
printf(“%d  Not Fibonacci prime”,n);
}
else
printf(“not prime “);
}
Input:-enter the number  13
Output:- 13 is Fibonacci prime