Average Error: 63.0 → 0.0
Time: 3.4s
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 r69743 = n;
        double r69744 = 1.0;
        double r69745 = r69743 + r69744;
        double r69746 = log(r69745);
        double r69747 = r69745 * r69746;
        double r69748 = log(r69743);
        double r69749 = r69743 * r69748;
        double r69750 = r69747 - r69749;
        double r69751 = r69750 - r69744;
        return r69751;
}

double f(double n) {
        double r69752 = 1.0;
        double r69753 = 1.0;
        double r69754 = n;
        double r69755 = r69753 / r69754;
        double r69756 = log(r69755);
        double r69757 = r69752 * r69756;
        double r69758 = 0.16666666666666669;
        double r69759 = 2.0;
        double r69760 = pow(r69754, r69759);
        double r69761 = r69753 / r69760;
        double r69762 = r69758 * r69761;
        double r69763 = r69757 + r69762;
        double r69764 = r69752 - r69763;
        double r69765 = 0.5;
        double r69766 = r69765 / r69754;
        double r69767 = r69764 + r69766;
        double r69768 = r69767 - r69752;
        return r69768;
}

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 2020056 
(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))