Question

6. Supposewewishtofindaformulaforan = i=1i ,thesumofall4thpowersupton . Writean inthe (p)
form of a recurrence relation (including initial value). What is the form of the particular solution an ?
(p) You do not need to solve for the coefficients of an .

Answer 1

recurrence ->

f(n) = f(n-1)+4^n

Code

This is in C++

--------------------------------------------------

#include<bits/stdc++.h>

using namespace std;

long f(int n){

    return n==0?1:(f(n-1)+pow(4,n));

}

int main(){

    for(int i=0;i<5;i++)

    cout<<f(i)<<"   ";

}