Consider the recurrence relation a = 3a n-1 +2 with base condition a = 2 0...

Transcribed Image Text:

Consider the recurrence relation a = 3a n-1 +2 with base condition a = 2 0 a) Use iteration to obtain an explicit formula (closed form) for the nth term in this sequence. b) Prove, using induction, that this formula satisfies the recurrence relation. Consider the recurrence relation a = 3a n-1 +2 with base condition a = 2 0 a) Use iteration to obtain an explicit formula (closed form) for the nth term in this sequence. b) Prove, using induction, that this formula satisfies the recurrence relation.