Binary Representation: Log or Ln?

  • Thread starter Thread starter Dominic M Sangma
  • Start date Start date
  • Tags Tags
    Difference Ln Log
Dominic M Sangma
Messages
1
Reaction score
0
What is the difference between log and ln??

[Thread moved to General Math forum by moderator]
 
Last edited by a moderator:
Mathematics news on Phys.org
Log is based on powers of 10, often called Common Log. Ln is based on powers of e (that's 2.71828...), called Natural Log.

By the way, questions should be asked in one of the main Forums. This section is for New Member Introductions. Please read the general information about how things are normally done here. Click on the INFO at the top right of the page.

Oh! And welcome to PF. Hope you find it useful.

Tom
 
Last edited:
Tom.G said:
Log is based on powers of 10
That depends on the context.
In physics it is typically base 10, in mathematics it is usually base e, and in computer science it is base 2.

If you want to make the base clear, use lg (10), ln (e) or ld (2).
 
  • Like
Likes fresh_42
I think ##\log = \ln## became more and more the standard, and ##\ln## is a bit old fashioned. A clear line or convention cannot be drawn as it depends on the author what he uses. If no base is mentioned, I'll always vote for base ##\mathbf{e}##, even in CS, because they vary only by a constant factor which usually doesn't play a role, e.g. in runtime calculations.
 
The base matters if you want to determine e.g. how many bits you need to represent something in binary.
 
mfb said:
The base matters if you want to determine e.g. how many bits you need to represent something in binary.
Yeah, all O(1) to me. :cool:

I must admit it's a bit of a Bill Gates attitude: "I don't care the hardware."
 
  • Like
Likes jbriggs444
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