\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(-\log n, 1, \frac{0.1666666666666666851703837437526090070605}{n \cdot n}\right)double f(double n) {
double r57002 = n;
double r57003 = 1.0;
double r57004 = r57002 + r57003;
double r57005 = log(r57004);
double r57006 = r57004 * r57005;
double r57007 = log(r57002);
double r57008 = r57002 * r57007;
double r57009 = r57006 - r57008;
double r57010 = r57009 - r57003;
return r57010;
}
double f(double n) {
double r57011 = 0.5;
double r57012 = n;
double r57013 = r57011 / r57012;
double r57014 = log(r57012);
double r57015 = -r57014;
double r57016 = 1.0;
double r57017 = 0.16666666666666669;
double r57018 = r57012 * r57012;
double r57019 = r57017 / r57018;
double r57020 = fma(r57015, r57016, r57019);
double r57021 = r57013 - r57020;
return r57021;
}




Bits error versus n
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0 |
Initial program 63.0
Simplified62.0
Taylor expanded around inf 0.0
Simplified0
Final simplification0
herbie shell --seed 2019350 +o rules:numerics
(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))