Approximation of values from non-closed form equation.

Legaldose
Messages
73
Reaction score
6
Hello everyone, I'm working on a problem and it turns out that this equation crops up:

1 = cos^{2}(b)[1-(c-b)^{2}]

where

c > \pi

Now I'm pretty sure you can't solve for b in closed form (at least I can't), so what I need to do is for some value of c, approximate the value of b to about 5-6 digits of accuracy. I just need tips to head in the right direction. Anything will be useful. Thank you!
 
Mathematics news on Phys.org
1 = cos^{2}(b)[1-(c-b)^{2}]
1-cos^{2}(b) = cos^{2}(b)[-(c-b)^{2}]
sin^{2}(b) = cos^{2}(b)[-(c-b)^{2}]
tan^{2}(b) = -(c-b)^{2}
For real solution, positive term = negative term is only possible if they are =0.
Hence the solution is : c=b=n\pi
 
  • Like
Likes 1 person
Oh okay, thanks JJacquelin, I didn't even think to do this.
 
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