\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\mathsf{fma}\left(\frac{1}{n}, \frac{1}{2} - \frac{\frac{1}{6}}{n}, \log n\right)double f(double n) {
double r2106991 = n;
double r2106992 = 1.0;
double r2106993 = r2106991 + r2106992;
double r2106994 = log(r2106993);
double r2106995 = r2106993 * r2106994;
double r2106996 = log(r2106991);
double r2106997 = r2106991 * r2106996;
double r2106998 = r2106995 - r2106997;
double r2106999 = r2106998 - r2106992;
return r2106999;
}
double f(double n) {
double r2107000 = 1.0;
double r2107001 = n;
double r2107002 = r2107000 / r2107001;
double r2107003 = 0.5;
double r2107004 = 0.16666666666666666;
double r2107005 = r2107004 / r2107001;
double r2107006 = r2107003 - r2107005;
double r2107007 = log(r2107001);
double r2107008 = fma(r2107002, r2107006, r2107007);
return r2107008;
}




Bits error versus n
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0 |
Initial program 63.0
Simplified61.9
Taylor expanded around inf 0.0
Simplified0
Final simplification0
herbie shell --seed 2019163 +o rules:numerics
(FPCore (n)
:name "logs (example 3.8)"
: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))