Warning: foreach() argument must be of type array|object, bool given in /var/www/html/web/app/themes/studypress-core-theme/template-parts/header/mobile-offcanvas.php on line 20

47. A new employee at an exciting new software company starts with a salary of550,000and is promised that at the end of each year her salary will be double her salary of the previous year, with an extra increment of$ 10,000 for each year she has been with the company.

a) Construct a recurrence relation for her salary for hern th year of employment.

b) Solve this recurrence relation to find her salary for hern th year of employment.

Some linear recurrence relations that do not have constant coefficients can be systematically solved. This is the case for recurrence relations of the form \(f(n){a_n} = g(n){a_{n - 1}} + h(n)\)Exercises 48-50 illustrate this.

Short Answer

Expert verified

(a) an=2an-1+10000(n-1),a1=50000

(b) an=35000·2n-10000n-10000=70000·2n-1-10000n-10000

Step by step solution

Achieve better grades quicker with Premium

  • Unlimited AI interaction
  • Study offline
  • Say goodbye to ads
  • Export flashcards

Over 22 million students worldwide already upgrade their learning with Vaia!

01

Linear Homogeneous Recurrence Relations with Constant Coefficients definition

Let\({c_1}\)and\({c_2}\)be real numbers. Suppose that\({r^2} - {c_1}r - {c_2} = 0\)has two distinct roots\({r_1}\)and\({r_2}\). Then the sequence\(\left\{ {{a_n}} \right\}\)is a solution of the recurrence relation\({a_n} = {c_1}{a_{n - 1}} + {c_2}{a_{n - 2}}\)if and only if\({a_n} = {\alpha _1}r_1^n + {\alpha _2}r_2^n\)for\(n = 0,1,2, \ldots \), where\({\alpha _1}\)and\({\alpha _2}\)are constants.

02

Use Recurrence Relations for part (a)           

(a) Derivation recurrence relation

Let anrepresent the salary at the n th year.

First case The salary doubles in comparison to the previous year. The salary of the previous year is an-1.

2an-1

Second case An extra 10000 dollars is added to the salary for each of the n-1 years that she has been with the company.

10000(n-1)

Add all number of pairs for each case:

an=2an-1+10000(n-1)

Initial conditions

At the beginning of the first year, the salary is50,000a1=50000

03

Use Recurrence Relations for part (b)

(b) Let \({a_n} = r\) and \({a_{n - 1}} = 1\) (other functions of \(n\) are considered to be 0 ) and \(r = 2\)

The solution of the recurrence relation is then of the form\({a_n} = {\alpha _1}r_1^n + {\alpha _2}nr_1^n + \ldots + {\alpha _k}{n^{k - 1}}r_1^n\) with\({r_1}\) a root with multiplicity\(k\) of the characteristic equation.

\(a_n^{(h)} = \alpha \cdot {2^n}\)

Thus the solution of the homogeneous recurrence relation is\(a_n^{(h)} = \alpha \cdot {2^n}\)

\(F(n) = 10000(n - 1) = 10000(n - 1) \cdot {1^n}\)

If\(F(n) = \left( {{b_t}{n^t} + {b_{t - 1}}{n^{t - 1}} + \ldots + {b_1}n + {b_0}} \right){s^n}\) and\(s\) is not a root of the characteristic equation, then\(\left( {{p_t}{n^t} + {p_{t - 1}}{n^{t - 1}} + \ldots + {p_1}n + {p_0}} \right){s^n}\) is the particular solution.

If\(F(n) = \left( {{b_t}{n^t} + {b_{t - 1}}{n^{t - 1}} + \ldots + {b_1}n + {b_0}} \right){s^n}\) and\(s\) is\({\bf{a}}\)root of the characteristic equation with multiplicity\({m_r}\) then\({n^m}\left( {{p_t}{n^t} + {p_{t - 1}}{n^{t - 1}} + \ldots + {p_1}n + {p_0}} \right){s^n}\)is the particular solution.

1 is not a root of the characteristic equation:

\(a_n^{(p)} = \left( {{p_1}n + {p_0}} \right) \cdot {1^n} = {p_1}n + {p_0}\)

The particular solution needs to satisfy the recurrence relation:

\(\begin{array}{l}{a_n} = 2{a_{n - 1}} + 10000(n - 1){p_1}n + {p_0}\\{a_n} = 2\left( {{p_1}(n - 1) + {p_0}} \right) + 10000(n - 1){p_1}n + {p_0}\\{a_n} = 2{p_1}n - 2{p_1} + 2{p_0} + 10000n - 100000\\{a_n} = \left( {{p_1} + 10000} \right)n + \left( { - 2{p_1} + {p_0} - 10000} \right){\rm{ }}\end{array}\)

All coefficients then need to be zero\({p_1} + 10000 = 0 - 2{p_1} + {p_0} - 10000 = 0{\rm{ }}\)

Solve each equation:

\(\begin{array}{l}{\rm{ }}{p_1} = - 10000\\{p_0} = 10000 + 2{p_1}\\{p_0} = 10000 + 2( - 10000)\\{p_0} = - 10000\end{array}\)

The particular solution then becomes:

\(a_n^{(p)} = {p_1}n + {p_0} = - 10000n - 10000\).

04

Solve the relation

The solution of the nonhomogeneous linear recurrence relation is the sum of the homogeneous\(a_n^{(h)}\) and particular solution\(a_n^{(p)}\)

\({a_n} = a_n^{(h)} + a_n^{(p)} = \alpha \cdot {2^n} - 10000n - 10000\)

Evaluate\({a_n} = \alpha \cdot {2^n} - 10000n - 10000\) at\(n = 1\)

Equation is:\(50000 = {a_1} = 2\alpha - 10000 - 10000\)

Combine like terms:\(50000 = 2\alpha - 20000\)

Add 20000 to each side\(70000 = 2\alpha \)

Divide each side by\(2\):\(35000 = \alpha \)

The solution of the nonhomogeneous linear recurrence relation then becomes:

\(\begin{array}{l}{a_n} = \alpha \cdot {2^n} - 10000n - 10000\\{a_n} = 35000 \cdot {2^n} - 10000n - 10000\\{a_n} = 70000 \cdot {2^{n - 1}} - 10000n - 10000\end{array}\)

One App. One Place for Learning.

All the tools & learning materials you need for study success - in one app.

Get started for free

Most popular questions from this chapter

LetG(x)be the sequence of Catalan numbers, that is, the solution to the recurrence relationwith.

(a)Show that ifis the generating function for the sequence of Catalan numbers, thenxG(x)2-G(x)+1=0. Conclude (using the initial conditions) thatG(x)=(1-1-4x)/(2x).

(b) Use Exercise 40 to conclude that G(x)=n=01n+1(2nn)xn,so thatCn=1n+1(2nn).

(c) Show thatCn2n-1for all positive integersn.

Use Exercise 31 to show that if a<bd, thenf(n)isO(nlogba).

Find the coefficient of \({x^9}\) in the power series of each of these functions.

a) \({\left( {1 + {x^3} + {x^6} + {x^9} + \cdots } \right)^3}\)

b) \({\left( {{x^2} + {x^3} + {x^4} + {x^5} + {x^6} + \cdots } \right)^3}\)

c) \(\left( {{x^3} + {x^5} + {x^6}} \right)\left( {{x^3} + {x^4}} \right)\left( {x + {x^2} + {x^3} + {x^4} + \cdots } \right)\)

d) \(\left( {x + {x^4} + {x^7} + {x^{10}} + \cdots } \right)\left( {{x^2} + {x^4} + {x^6} + {x^8} + } \right.\)\( \cdots )\)

e) \({\left( {1 + x + {x^2}} \right)^3}\)

What is the generating function for the sequence ck, where ck represents the number of ways to make change for k pesos using bills worth 10 pesos, 20 pesos, 50 pesos, and 100 pesos?

Set up a divide-and-conquer recurrence relation for the number of modular multiplications required to compute \({a^n}\,\bmod \,\;m,\) where\(a,\;n\), and \(n\) are positive integers, using the recursive algorithms from Example 4 in Section 5.4.

b) Use the recurrence relation you found in part (a) to construct a big-\(O\)estimate for the number of modular multiplications used to compute\({a^n}\,\bmod \,\;m\)using the recursive algorithm.

See all solutions

Recommended explanations on Math Textbooks

View all explanations

What do you think about this solution?

We value your feedback to improve our textbook solutions.

Study anywhere. Anytime. Across all devices.

Sign-up for free