Easy and useful way to calculate Log(a+b)

  • Thread starter Thread starter guifb99
  • Start date Start date
  • Tags Tags
    Log Logarithms
guifb99
Messages
10
Reaction score
1
a>b ⇒ Lim(a–b)→0 Logc(a+b) ≈ Logc(a) + Logc(√a⋅b)

b>a ⇒ Lim(b–a)→0 Logc(a+b) ≈ Logc(a) + Logc(√a⋅b)

a∈ℝ
b∈ℝ
c∈ℝ / c>0
 
Last edited:
Mathematics news on Phys.org
guifb99 said:
a>b ⇔ Lim(a–b)→0 Logc(a+b) ≈ Logc(a) + Logc(√a⋅b)

b>a ⇔ Lim(b–a)→0 Logc(a+b) ≈ Logc(a) + Logc(√a⋅b)

a∈ℝ
b∈ℝ
c∈ℝ / c>0

Yes, this is the second post I do about it, but now I did it in a better format, the other one was too confusing because I didn't know how to use the mathematical symbols in the thread, I'm new here.
 
guifb99 said:
a>b ⇒ Lim(a–b)→0 Logc(a+b) ≈ Logc(a) + Logc(√a⋅b)

b>a ⇒ Lim(b–a)→0 Logc(a+b) ≈ Logc(a) + Logc(√a⋅b)
I don't see the point of writing this as a limit. Also, when you take a limit, use =, not ≈.
[QUOTE="guifb99]
a∈ℝ
b∈ℝ
[/quote]These won't do. You need to have a + b > 0 and ab > 0, not just arbitrary real numbers.
[QUOTE="guifb99]
c∈ℝ / c>0[/QUOTE]
Also, c cannot be 1.
 
But this only calculates log(a+b) in the limit when (a-b) = 0 i.e. a=b. Then we have $$
\begin{align*} \log(a+b) &= \log(2a) = \log 2 + \log a \\
\log a + \log \sqrt{a \cdot a} &= 2 \log a \end{align*}
$$ So your equation is only true when a=b=2: that doesn't look very useful to me.
 
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