\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(1, -\log n, \frac{0.16666666666666669}{n \cdot n}\right)double f(double n) {
double r90479 = n;
double r90480 = 1.0;
double r90481 = r90479 + r90480;
double r90482 = log(r90481);
double r90483 = r90481 * r90482;
double r90484 = log(r90479);
double r90485 = r90479 * r90484;
double r90486 = r90483 - r90485;
double r90487 = r90486 - r90480;
return r90487;
}
double f(double n) {
double r90488 = 0.5;
double r90489 = n;
double r90490 = r90488 / r90489;
double r90491 = 1.0;
double r90492 = log(r90489);
double r90493 = -r90492;
double r90494 = 0.16666666666666669;
double r90495 = r90489 * r90489;
double r90496 = r90494 / r90495;
double r90497 = fma(r90491, r90493, r90496);
double r90498 = r90490 - r90497;
return r90498;
}




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