(11C) TVM for HP-11C
|
12-05-2020, 01:05 AM
Post: #11
|
|||
|
|||
RE: (11C) TVM for HP-11C
From thread: Fun math algorithms:
(10-19-2020 11:05 PM)Albert Chan Wrote: We can use \(C_±\) to solve Time value of money problem, if I is small, and N not too big. XCas> factor(symb2poly(eqn,I)); // quadratic coefficients, for I [N^2*(FV+PV)/12 , (-FV*N+N*PV+FV+PV)/2 , N*PMT+FV+PV] Divide coefficiens by (FV+PV): [N^2/12 , (1 - N*(FV-PV)/(FV+PV))/2, PMT*N/(FV+PV) + 1] Solving the quadratic, for the "small" root of I, we have: Code: function guess_i(n, pv, pmt, fv) -- cash-flow sign convention (12-03-2020 08:53 PM)Albert Chan Wrote: lua> g = pv_i(12, 5000/500) -- guess_i = 0.030555555555555558 For above examples, guess_i() gives about 3 good digits. lua> guess_i(12, 5000, -500, 0) 0.02919560045657818 lua> guess_i(12, 0, -400, 5000) 0.007391943630478942 |
|||
« Next Oldest | Next Newest »
|
User(s) browsing this thread: 5 Guest(s)