I Approximation to sqrt(1+(d^2)/(x^2))

MOHD ZAKI
Messages
1
Reaction score
0
using binomial theorem can I write sqrt(1+(d^2)/(x^2)) = 1+ .5(d^2)/(x^2)?
d is a variable. X known constant.
 
Mathematics news on Phys.org
If ##d^2 < x^2##, then you can indeed write an approximate equality

\sqrt{1+ \frac{d^2}{x^2}}\approx 1 + \frac{1}{2} \frac{d^2}{x^2}

Whether this approximation is good enough depends entirely on the specifics.

If ##d^2 = x^2##, then it's a boundary case. You can still write the above approximaton, but this is very sensitive to errors. For example, if you measured ##d## or ##x## a bit incorrectly, then you could be in trouble easily.
 
@micromass: the sensitivity to d and x individually should not depend on the approximation made.
If d2=x2, then the left side is about 1.41 and the right side is 1.5, so we have some notable deviation.
 
MOHD ZAKI said:
using binomial theorem can I write sqrt(1+(d^2)/(x^2)) = 1+ .5(d^2)/(x^2)?
d is a variable. X known constant.
For a first approximation, yes. But you can do better:

  1. Calculate a=1+\frac{d^{2}}{x^{2}}
  2. Let z_{0}=1+\frac{1}{2}\frac{d^{2}}{x^{2}}=\frac{1+a}{2}
  3. Then z_{n+1}=\frac{1}{2}(z_{n}+\frac{a}{z_{n}}) is a better approximation.
Stop when zn+1 is sufficiently close to zn.

In the example above (d=x); a = 2 and z0 = 1.5. Then z1 = 1.417 and z2 = 1.414
 
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.

Similar threads

Back
Top