\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 r69455 = n;
double r69456 = 1.0;
double r69457 = r69455 + r69456;
double r69458 = log(r69457);
double r69459 = r69457 * r69458;
double r69460 = log(r69455);
double r69461 = r69455 * r69460;
double r69462 = r69459 - r69461;
double r69463 = r69462 - r69456;
return r69463;
}
double f(double n) {
double r69464 = 1.0;
double r69465 = n;
double r69466 = r69464 / r69465;
double r69467 = 0.5;
double r69468 = 0.16666666666666669;
double r69469 = r69468 / r69465;
double r69470 = r69467 - r69469;
double r69471 = log(r69465);
double r69472 = 1.0;
double r69473 = r69471 * r69472;
double r69474 = fma(r69466, r69470, r69473);
return r69474;
}




Bits error versus n
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0.0 |
Initial program 63.0
Simplified61.9
Taylor expanded around inf 0.0
Simplified0.0
Final simplification0.0
herbie shell --seed 2020049 +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))