MHB How Many Times Do I Have To Increase by 3%?

  • Thread starter Thread starter piAreRound1
  • Start date Start date
  • Tags Tags
    increase
piAreRound1
Messages
1
Reaction score
0
I want to know how many time I have to increase 30 by 3% before it is greater or equal to 500.

I think this is the correct formula:
30 * 1.03^x >= 500

What steps do I have to take to solve it?
 
Mathematics news on Phys.org
I would write:

$$30\cdot1.03^n\ge500$$

Divide through by 30:

$$1.03^n\ge\frac{50}{3}$$

Take the natural log of both sides, and apply a log rule to obtain:

$$n\ln(1.03)\ge\ln\left(\frac{50}{3}\right)$$

Hence:

$$n\ge\frac{\ln\left(\dfrac{50}{3}\right)}{\ln(1.03)}$$

Since presumably \(n\) is an integer, we could write:

$$n=\left\lceil\frac{\ln\left(\dfrac{50}{3}\right)}{\ln(1.03)}\right\rceil$$

This is the "ceiling" function and it tells us to round up to the nearest integer. According to W|A, we find:

$$n=96$$

Wolfram|Alpha: Computational Intelligence
 
piAreRound said:
I want to know how many time I have to increase 30 by 3% before it is greater or equal to 500.
Tattoo this on your wrist (under your watch!):

if a^p = b then p = ln(b) / ln(a)
 
My wrist is getting awfully crowded!
 
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