\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 r316 = n;
double r317 = 1.0;
double r318 = r316 + r317;
double r319 = log(r318);
double r320 = r318 * r319;
double r321 = log(r316);
double r322 = r316 * r321;
double r323 = r320 - r322;
double r324 = r323 - r317;
return r324;
}
double f(double n) {
double r325 = 1.0;
double r326 = n;
double r327 = r325 / r326;
double r328 = 0.5;
double r329 = 0.16666666666666669;
double r330 = r329 / r326;
double r331 = r328 - r330;
double r332 = log(r326);
double r333 = 1.0;
double r334 = r332 * r333;
double r335 = fma(r327, r331, r334);
return r335;
}




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