\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\mathsf{fma}\left(\frac{1}{n}, 0.5 - \frac{0.1666666666666666851703837437526090070605}{n}, \log n \cdot 1\right)double f(double n) {
double r68416 = n;
double r68417 = 1.0;
double r68418 = r68416 + r68417;
double r68419 = log(r68418);
double r68420 = r68418 * r68419;
double r68421 = log(r68416);
double r68422 = r68416 * r68421;
double r68423 = r68420 - r68422;
double r68424 = r68423 - r68417;
return r68424;
}
double f(double n) {
double r68425 = 1.0;
double r68426 = n;
double r68427 = r68425 / r68426;
double r68428 = 0.5;
double r68429 = 0.16666666666666669;
double r68430 = r68429 / r68426;
double r68431 = r68428 - r68430;
double r68432 = log(r68426);
double r68433 = 1.0;
double r68434 = r68432 * r68433;
double r68435 = fma(r68427, r68431, r68434);
return r68435;
}




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 2020001 +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))