Mathematics Homework Solutions
Problem
#203522

Recurrence relation problem. Backwards substitution.

I need to know how to solve this problem:

Solve the following recurrence relation: x(n) = 3x(n-1) for n > 1, x(1) = 4.

It requires backwards substitution to solve.


Solution Summary

This provides an example of using backwards substitution for a recurrence relation problem.

Solution
What is this?
By OTA - Overall OTA Rating
Yanfang Li, PhD - 4.9/5
Purchase Cost Now
$2.19 CAD (was ~$7.98)
Included in Download
  • Plain text response
  • Attached file(s):
    • Recurrence relation problem.doc
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Recurrence Relations - Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) with the initial conditions a(0)=0 and a(1)=2. Solve the recurrence relation a(n)=3a(n-1)+10a(n-2) +12 with the initial conditions a(0)=0 and a(1 ...
  • General solutions to recurrence relations. - I need to find the general solution for the following recurrence relation but in a form that doesn't contain complex numbers. a_{n+2}+2a_{n+1}+5a_n = 0
  • Solving a Recurrence Relation - Solve the recurrence relation: a(n) = 3a(n-1) - 3 a(n-2) + a(n-3), a0=1, a1=1, a2=2 -where the value in brackets reads sub. a(n) is 'a' subscript 'n'
  • Solutions of Recurrence Relations - Consider the recurrence relation . Show that the general solution is . Show that the solution with starting values and corresponds to and . Please see the attached file for the f ...
  • Series Convergence of a Recurrence Relation - Prove that the series given by the recurrence relation a_n+1 = SQRT(3*a_n), where a_1 = 4, converges, and find the limit of convergence.
Browse