Average Error: 63.0 → 0.0
Time: 4.3s
Precision: 64
\[n \gt 6.8 \cdot 10^{15}\]
\[\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1\]
\[\left(\left(1 - \left(1 \cdot \log \left(\frac{1}{n}\right) + 0.16666666666666669 \cdot \frac{1}{{n}^{2}}\right)\right) + \frac{0.5}{n}\right) - 1\]
\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\left(\left(1 - \left(1 \cdot \log \left(\frac{1}{n}\right) + 0.16666666666666669 \cdot \frac{1}{{n}^{2}}\right)\right) + \frac{0.5}{n}\right) - 1
double f(double n) {
        double r37389 = n;
        double r37390 = 1.0;
        double r37391 = r37389 + r37390;
        double r37392 = log(r37391);
        double r37393 = r37391 * r37392;
        double r37394 = log(r37389);
        double r37395 = r37389 * r37394;
        double r37396 = r37393 - r37395;
        double r37397 = r37396 - r37390;
        return r37397;
}

double f(double n) {
        double r37398 = 1.0;
        double r37399 = 1.0;
        double r37400 = n;
        double r37401 = r37399 / r37400;
        double r37402 = log(r37401);
        double r37403 = r37398 * r37402;
        double r37404 = 0.16666666666666669;
        double r37405 = 2.0;
        double r37406 = pow(r37400, r37405);
        double r37407 = r37399 / r37406;
        double r37408 = r37404 * r37407;
        double r37409 = r37403 + r37408;
        double r37410 = r37398 - r37409;
        double r37411 = 0.5;
        double r37412 = r37411 / r37400;
        double r37413 = r37410 + r37412;
        double r37414 = r37413 - r37398;
        return r37414;
}

Error

Bits error versus n

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Target

Original63.0
Target0
Herbie0.0
\[\log \left(n + 1\right) - \left(\frac{1}{2 \cdot n} - \left(\frac{1}{3 \cdot \left(n \cdot n\right)} - \frac{4}{{n}^{3}}\right)\right)\]

Derivation

  1. Initial program 63.0

    \[\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1\]
  2. Taylor expanded around inf 0.0

    \[\leadsto \color{blue}{\left(\left(0.5 \cdot \frac{1}{n} + 1\right) - \left(1 \cdot \log \left(\frac{1}{n}\right) + 0.16666666666666669 \cdot \frac{1}{{n}^{2}}\right)\right)} - 1\]
  3. Simplified0.0

    \[\leadsto \color{blue}{\left(\left(1 - \left(1 \cdot \log \left(\frac{1}{n}\right) + 0.16666666666666669 \cdot \frac{1}{{n}^{2}}\right)\right) + \frac{0.5}{n}\right)} - 1\]
  4. Final simplification0.0

    \[\leadsto \left(\left(1 - \left(1 \cdot \log \left(\frac{1}{n}\right) + 0.16666666666666669 \cdot \frac{1}{{n}^{2}}\right)\right) + \frac{0.5}{n}\right) - 1\]

Reproduce

herbie shell --seed 2020089 
(FPCore (n)
  :name "logs (example 3.8)"
  :precision binary64
  :pre (> n 6.8e+15)

  :herbie-target
  (- (log (+ n 1)) (- (/ 1 (* 2 n)) (- (/ 1 (* 3 (* n n))) (/ 4 (pow n 3)))))

  (- (- (* (+ n 1) (log (+ n 1))) (* n (log n))) 1))