I Find t to Satisfy e^iat=e^ia_0, e^ibt=e^ib_0, e^ibct=e^ic_0

  • I
  • Thread starter Thread starter maka89
  • Start date Start date
  • Tags Tags
    Infinity
maka89
Messages
66
Reaction score
4
If there is no upper limit on t, can you find a t such that: e^{iat} = e^{ia_0}, e^{ibt} = e^{ib_0} and e^{ibct} = e^{ic_0} at the same time?

No matter what a,b and c is, though given a != b , a!=c, b!=c and a!= 0, b!= 0, c!=0

Or maybe rather:
at=a_0 +k_12\pi, bt=b_0 +k_22\pi and ct=c_0 +k_32\pi, where the k's are integers

I think it seems reasonable that you can, or at least come arbitrarily close to the equations being satisfied... But don't know how to prove it, or if I am right... Any pointers?
 
Mathematics news on Phys.org
Are you really talking factorials up there, or were you trying to type "not equals" (≠)?
 
Not in general.

Consider a=2, b=1, a0=0 and b0 = 0.1. Clearly t=kπ solves the first equation, but does not solve or even approximate the second one.

If you require that a,b,c do not have a pair which have a common multiple, there should be approximations to arbitrary precision. In general there won't be an exact solution here either.
 
Not equals, mjc123 ;)

Thanks mfb! Forgot to mention, I assumed a is not a multiple of b etc.
 
maka89 said:
I assumed a is not a multiple of b etc.
That is not general enough.
a=2 and b=3 still lead to a common multiple of 6, and the same result.

If we don't have that case, in general all you get is an approximation.
 
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