Dismiss Notice
Join Physics Forums Today!
The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

B How come this natural logarithm approximation works?

  1. Dec 1, 2016 #1
    I came across a guy claiming that the "best approximation" for the natural logarithm of a number is this:
    ln x=2^n*(x^(2^-n)-1)

    Oddly enough, it seems to work rather well! I don't really get why it does... I also don't know if it has a limit, I couldn't test it as I don't have access to my laptop right now, but I can't understand WHY it seems to work, at least for n as high as 25.
     
  2. jcsd
  3. Dec 1, 2016 #2

    mfb

    User Avatar
    2016 Award

    Staff: Mentor

    What is n?

    With n=0, we get ##\ln(x) \approx x-1## which is the start of the taylor series around x=1.

    In the limit n->infinity, the formula is exact. Introduce u=2^n to shorten formulas:

    $$\lim_{u \to \infty} u (x^{1/u}-1) = \lim_{u \to \infty} u (e^{ln(x)/u}-1) = \lim_{u \to \infty} u (1+\frac{\ln(x)}{u} + O(\frac{1}{u^2})-1) = \ln(x)$$
     
    Last edited: Dec 1, 2016
  4. Dec 1, 2016 #3
    N is a very large natural number.
     
  5. Dec 1, 2016 #4
    I tested it with n=25 for 2, 5, 10 and 15 and for some weird reason it worked.
     
  6. Dec 1, 2016 #5

    RUber

    User Avatar
    Homework Helper

    Is this a series? Where ## \ln x = \sum_{n = 0}^\infty 2^n \left( x^{2^{-n}} - 1 \right) ? ##
    If so, compare that to the power series of the log centered at 2.
    ## \ln x = \ln 2 + \sum_{n = 1}^\infty \frac{(-1)^{n-1} (x - 2)^n}{2^n n} ##
    It looks like there might be some similar terms...
     
  7. Dec 1, 2016 #6
    First, I think you forgot something, the first term in the parenthesis is x^(2^-n), not x^(2^n).

    No, it's not a series.
     
  8. Dec 1, 2016 #7

    mfb

    User Avatar
    2016 Award

    Staff: Mentor

    See my edit in my previous post. For the limit of n to infinity, the formula is exact (proof in the post). For large n, it can give a reasonable approximation, the range where the approximation works grows with n.
     
  9. Dec 1, 2016 #8
    Oh, so it is actually a good approximation. Weird, I had never heard of it again. Is anyone aware of where it first appeared?
     
  10. Dec 1, 2016 #9

    mfb

    User Avatar
    2016 Award

    Staff: Mentor

    It is prone to numerical errors, for large n you subtract 1 from a number close to 1. I don't see practical applications of this formula in this direction. Maybe in the opposite direction (using log(x) to approximate the exponential), but that is equivalent to a taylor approximation.
     
  11. Dec 1, 2016 #10
    Yes, it's not practical, but it's accurate if you're accurate. At first I thought it was something like a mathematical coincidence that only sometimes works, but it turns out that it actually works.

    On a slightly unrelated note, do you know of any such "coincidences" or patterns or rules that only start to break after many, many numbers? I've always thought they were interesting mathematical objects, functions or series that "cheat" you into thinking they are going to be a certain way and then change unpredictably.
     
  12. Dec 1, 2016 #11

    mfb

    User Avatar
    2016 Award

    Staff: Mentor

    The Borwein integral



    The Hirsch conjecture fails first in 43 dimensions.

    Pólya conjecture: Is there a number N such that less than half of all numbers smaller than N have an odd number of prime factors?
    Yes, but the smallest example is 900 millions.

    a=n29 + 14 and b=(n+1)29 + 14 are relative prime for all numbers smaller than n=345253422116355058862366766874868910441560096980654656110408105446268691941239624255384457677726969174087561682040026593303628834116200365400, a number with 141 digits. Taken from here.

    Does the number of primes below N exceed ##\int_0^N \frac {dt}{\ln(t)}## for some N? Yes, but the smallest example must be larger than 1019, and it is expected to be around 10316. Related to Skewes' number.

    Mertens conjecture, yet another one about prime factors. The smallest counterexample has to be above 1016, but it could be as large as ~101040.
     
  13. Dec 1, 2016 #12

    fresh_42

    Staff: Mentor

    So there is still hope for my vicious fantasy that ERH will fail somewhere. :cool:
    Shouldn't your and my response be better placed in the Collatz conjecture thread?
     
  14. Dec 2, 2016 #13
    What is "ERH"? Anyways, I think that means there is still hope Collatz conjecture may be proven wrong!
     
  15. Dec 2, 2016 #14

    fresh_42

    Staff: Mentor

    Yes, and ERH is the extended Riemann hypothesis, which would be a sensation if proven wrong. I found @mfb's examples very interesting. I've read of an example about primes before, which first fails at ##41## and thought this would be a large number. I couldn't be more wrong. So thanks for this thread, which brought it up.
     
  16. Dec 2, 2016 #15
    trigonometrics integrals like The Borwein integral
    http://www.jstor.org/stable/40378359?seq=2#page_scan_tab_contents
    you must be log in , page 282 And onwards
     
Know someone interested in this topic? Share this thread via Reddit, Google+, Twitter, or Facebook

Have something to add?
Draft saved Draft deleted



Similar Discussions: How come this natural logarithm approximation works?
  1. Natural logarithms (Replies: 14)

  2. The natural logarithm (Replies: 5)

  3. Natural Logarithm (Replies: 6)

Loading...