Solve the Recurrence relation an = an-1 + 2, a0 = 3, n > 0 by Substitution method
Mathbot Says...
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.
Solve the Recurrence relation an = an-1 + 2, a0 = 3, n > 0 by Substitution method
I wasn't able to parse your question, but the HE.NET team is hard at work making me smarter.