Question

1,2,1,3,2,5,3,7,5,11,8,13,13,17,.. this serious is a mixture of 2 series all the odd term in this series from a fibonacci series and all the even term are the prime number in ascending order.find a program to find the nth term in this in python.

Answer 1

#include<stdio.h>

#define MAX 1000

void fibonacci(int n)

{

int i, term1 = 0, term2 = 1, nextTerm;

for (i = 1; i<=n; i++)

{

nextTerm = term1 + term2;

term1 = term2;

term2 = nextTerm;

}

printf("%d", term1);

}

void prime(int n)

{

int i, j, flag, count =0;

for (i=2; i<=MAX; i++)

{

flag = 0;

for (j=2; j<i; j++)

{

if(i%j == 0)

{

flag = 1;

break;

}

}

if (flag == 0)

count++;

if(count == n)

{

printf("%d", i);

break;

}

}

}

int main( )

{

int n;

scanf("%d", &n);

if(n%2 == 1)

fibonacci (n/2 + 1);

else

prime(n/2);

return 0;

}