Find the nth term of a sequence 1, 1, 2, 3, 5, 8, 13, 21, 34, . .

// here is code in C++.

#include <bits/stdc++.h>

using namespace std;

// function to find the nth term of sequence

int nth_fib(int n)

{

   // base case

   if (n <= 1)

       return n;

   return nth_fib(n-1) + nth_fib(n-2);

}

// main function

int main()

{

   // variables

int n,term;

cout<<"enter the term:";

// read the value of n

cin>>n;

// call the function

term=nth_fib(n);

// prinnt the nth term

cout<<n<<"th term in the sequence is: "<<term<<endl;

return 0;

}

Explanation:

The given sequence is Fibonacci sequence.Here first and second term is 1 and then 3rd term is sum of previous two terms. Similarly 4th term is sum of 2nd and 3rd term. Using this property of the sequence, we can find the nth term of the sequence. First read the term from user and call the function nth_fib() with parameter n. this function will return nth term of the sequence.If term is 1 or 2 then it will return 1.

Output:

enter the term:6

6th term in the sequence is: 8

definition of done. the definition of done may be changed at any time to reflect what a team can complete within each sprint. however, changing the dod should be an infrequent occurrence, and never something done prior to each sprint.

explanation:

answer assignment page;