Algorithm 3 Consider the following function F whose domain i

Algorithm

3. Consider the following function F whose domain is the set of all nonnegative integers: In the box below give a closed form representation for F F(N) Consider the following function G whose domain is the set of all nonnegative integer power

Solution

The sequence generated by F(N) is { 1,10, 37, ,98 . .. . . . .. }
So the closed form of F(N) is

(9*(3)ⁿ - 7)/2  

So F(N) = . ((9*(3)ⁿ) - 7)/2 .


We can verify by putting N = . 0,1,2,3...
To get {1,10,37,......}


Thanks, let me know if there is any concern.