How can logarithmic expressions be simplified effectively?

yungman
Messages
5,741
Reaction score
294
I want to verify this:

2ln(x)-ln(2x)=ln(x^2)-ln(2x)=ln\left(\frac{x^2}{2x}\right)=ln\left(\frac x 2\right)
ln(2x)-ln(x)=\ln\left(\frac {2x}{x}\right)=ln(2)

Thanks
 
Physics news on Phys.org
They're pretty straight applications of the log laws

log_{c}(a^{b}) = blog_{c}(a)

log_{c}(a) - log_{c}(b) = log_{c}(\frac{a}{b})
 
yungman said:
I want to verify this:

2ln(x)-ln(2x)=ln(x^2)-ln(2x)=ln\left(\frac{x^2}{2x}\right)=ln\left(\frac x 2\right)
ln(2x)-ln(x)=\ln\left(\frac {2x}{x}\right)=ln(2)

Thanks
You can also do the first one as

##\displaystyle 2\ln(x)-\ln(2x)=2\ln(x)-(\ln(x)+\ln(2))=\ln(x)-\ln(2)=\ln(x/2)
##
 
SammyS said:
You can also do the first one as

##\displaystyle 2\ln(x)-\ln(2x)=2\ln(x)-(\ln(x)+\ln(2))=\ln(x)-\ln(2)=\ln(x/2)
##

Thanks, I am so rusty on these math as I don't use it often! I was stuck for a day in the other thread about sine and cosine integrals because of this. All of a sudden, I remember all the log things and it answer my question there.

Many thanks.
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top