\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.16666666666666669}{n}, \log n \cdot 1\right)double f(double n) {
double r64345 = n;
double r64346 = 1.0;
double r64347 = r64345 + r64346;
double r64348 = log(r64347);
double r64349 = r64347 * r64348;
double r64350 = log(r64345);
double r64351 = r64345 * r64350;
double r64352 = r64349 - r64351;
double r64353 = r64352 - r64346;
return r64353;
}
double f(double n) {
double r64354 = 1.0;
double r64355 = n;
double r64356 = r64354 / r64355;
double r64357 = 0.5;
double r64358 = 0.16666666666666669;
double r64359 = r64358 / r64355;
double r64360 = r64357 - r64359;
double r64361 = log(r64355);
double r64362 = 1.0;
double r64363 = r64361 * r64362;
double r64364 = fma(r64356, r64360, r64363);
return r64364;
}




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