(11C) Solve for [i] given [n] [PMT] [FV]
|
04-15-2018, 05:49 PM
Post: #7
|
|||
|
|||
RE: (11C) Solve for [i] given [n] [PMT] [FV]
(04-14-2018 06:59 PM)Dieter Wrote: Why don't you simply take the usual approach with one single TVM equation which includes both PV and FV so that the interest rate can be calculated the same way for either case. I now have tried such a progam. Caveat: this is experimental code with some room for improvement. But it seems to work. Code: 001 LBL A Feel free to insert a PSE after line 078 or 080. You may also include a loop counter that cancels the iteration after, say, 12 loops. - This program uses the well-known sign convention. So for your above examples enter PMT with negative sign. - GSB 0 initializes the program and clears the relevant registers. - [A] stores n - [B] calculates i - [C] stores PMT - [D] stores PV - [E] stores FV Initialize with GSB 0 first. Enter n, PMT, PV and FV with the respective keys in any order. Press [B] to solve for i. The initial guess for i is calculated this way: Code: PV + n*PMT + FV Now try it and see what you get. Dieter |
|||
« Next Oldest | Next Newest »
|
Messages In This Thread |
(11C) Solve for [i] given [n] [PMT] [FV] - Gamo - 04-11-2018, 08:04 AM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - rprosperi - 04-11-2018, 12:58 PM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Dieter - 04-11-2018, 06:54 PM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Gamo - 04-12-2018, 01:43 PM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Gamo - 04-13-2018, 04:56 AM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Dieter - 04-14-2018, 06:59 PM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Dieter - 04-15-2018 05:49 PM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Gamo - 04-16-2018, 01:41 PM
RE: (11C) Solve for [i] given [n] [PMT] [FV] - Dieter - 04-16-2018, 06:24 PM
|
User(s) browsing this thread: 1 Guest(s)