Discrete Mathematics with Applications 4th Edition

Published by Cengage Learning
ISBN 10: 0-49539-132-8
ISBN 13: 978-0-49539-132-6

Chapter 5 - Sequences, Mathematical Induction, and Recursion - Exercise Set 5.7 - Page 315: 22

Answer

\[ \boxed{P_n = P_0 \,\biggl(1 + \frac{i}{m}\biggr)^{n}.} \]

Work Step by Step

Given the recurrence \[ P_k = \left(1 + \frac{i}{m}\right) P_{k-1}, \quad P_0 \text{ is the initial deposit}, \] we see this is a geometric progression with common ratio \(r = 1 + \tfrac{i}{m}\). Thus, by iterating: \[ P_k = \left(1 + \frac{i}{m}\right) P_{k-1} = \left(1 + \frac{i}{m}\right)\bigl[\left(1 + \frac{i}{m}\right) P_{k-2}\bigr] = \dots = \left(1 + \frac{i}{m}\right)^k P_{0}. \]
Update this answer!

You can help us out by revising, improving and updating this answer.

Update this answer

After you claim an answer you’ll have 24 hours to send in a draft. An editor will review the submission and either publish your submission or provide feedback.