MHB Find the maximum amount of the equal annual withdrawal

  • Thread starter Thread starter Joe_1234
  • Start date Start date
  • Tags Tags
    Maximum
Joe_1234
Messages
24
Reaction score
0
P25,000 is deposited in a savings account that pays 5% interest, compounded semi-annually. Equal annual withdrawals are to be made from the account, beginning one year from now and continuing forever. The maximum amount of the equal annual withdrawal is closest to
A. P625
B. P1000
C. P1250
D. P1625
 
Mathematics news on Phys.org
Hello, and welcome to MHB! :)

I would let \(A_n\) be the amount in the account at the end of year \(n\), and \(W\) be the amount withdrawn at the end of year \(n\). Then we may model this problem with the following recursion:

$$A_{n+1}=1.05A_{n}-W$$

Can you give the homogeneous solution (based on the root of the characteristic equation)?
 
I made an error in my above post, where I used annual compounding. We want:

$$A_{n+1}=1.025^2A_{n}-W=\left(\frac{41}{40}\right)^2A_{n}-W$$

And so our homogeneous solution will take the form:

$$h_n=c_1\left(\frac{41}{40}\right)^{2n}$$

Our particular solution will take the form:

$$p_n=B$$

Substitution into the recursion yields:

$$B-\left(\frac{41}{40}\right)^2B=-W$$

$$\left(\frac{9}{40}\right)^2B=W\implies B=\left(\frac{40}{9}\right)^2W$$

And so by the principle of superposition, we obtain:

$$A_{n}=h_n+p_n=c_1\left(\frac{41}{40}\right)^{2n}+\left(\frac{40}{9}\right)^2W$$

$$A_0=c_1+\left(\frac{40}{9}\right)^2W\implies c_1=A_0-\left(\frac{40}{9}\right)^2W$$

And so our closed form is:

$$A_{n}=\left(A_0-\left(\frac{40}{9}\right)^2W\right)\left(\frac{41}{40}\right)^{2n}+\left(\frac{40}{9}\right)^2W$$

To finish the problem, we want to set:

$$\lim_{n\to\infty}A_n=0$$

In order for that to happen (for the limit to be finite), we need:

$$W=\left(\frac{9}{40}\right)^2A_0$$

Using the value \(A_0=25000\), we then find:

$$W=\frac{10125}{8}=1265.625$$
 
MarkFL said:
I made an error in my above post, where I used annual compounding. We want:

$$A_{n+1}=1.025^2A_{n}-W=\left(\frac{41}{40}\right)^2A_{n}-W$$

And so our homogeneous solution will take the form:

$$h_n=c_1\left(\frac{41}{40}\right)^{2n}$$

Our particular solution will take the form:

$$p_n=B$$

Substitution into the recursion yields:

$$B-\left(\frac{41}{40}\right)^2B=-W$$

$$\left(\frac{9}{40}\right)^2B=W\implies B=\left(\frac{40}{9}\right)^2W$$

And so by the principle of superposition, we obtain:

$$A_{n}=h_n+p_n=c_1\left(\frac{41}{40}\right)^{2n}+\left(\frac{40}{9}\right)^2W$$

$$A_0=c_1+\left(\frac{40}{9}\right)^2W\implies c_1=A_0-\left(\frac{40}{9}\right)^2W$$

And so our closed form is:

$$A_{n}=\left(A_0-\left(\frac{40}{9}\right)^2W\right)\left(\frac{41}{40}\right)^{2n}+\left(\frac{40}{9}\right)^2W$$

To finish the problem, we want to set:

$$\lim_{n\to\infty}A_n=0$$

In order for that to happen (for the limit to be finite), we need:

$$W=\left(\frac{9}{40}\right)^2A_0$$

Using the value \(A_0=25000\), we then find:

$$W=\frac{10125}{8}=1265.625$$
Tnx Sir
 
Insights auto threads is broken atm, so I'm manually creating these for new Insight articles. In Dirac’s Principles of Quantum Mechanics published in 1930 he introduced a “convenient notation” he referred to as a “delta function” which he treated as a continuum analog to the discrete Kronecker delta. The Kronecker delta is simply the indexed components of the identity operator in matrix algebra Source: https://www.physicsforums.com/insights/what-exactly-is-diracs-delta-function/ by...
Fermat's Last Theorem has long been one of the most famous mathematical problems, and is now one of the most famous theorems. It simply states that the equation $$ a^n+b^n=c^n $$ has no solutions with positive integers if ##n>2.## It was named after Pierre de Fermat (1607-1665). The problem itself stems from the book Arithmetica by Diophantus of Alexandria. It gained popularity because Fermat noted in his copy "Cubum autem in duos cubos, aut quadratoquadratum in duos quadratoquadratos, et...
I'm interested to know whether the equation $$1 = 2 - \frac{1}{2 - \frac{1}{2 - \cdots}}$$ is true or not. It can be shown easily that if the continued fraction converges, it cannot converge to anything else than 1. It seems that if the continued fraction converges, the convergence is very slow. The apparent slowness of the convergence makes it difficult to estimate the presence of true convergence numerically. At the moment I don't know whether this converges or not.
Back
Top