\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 r73456 = n;
double r73457 = 1.0;
double r73458 = r73456 + r73457;
double r73459 = log(r73458);
double r73460 = r73458 * r73459;
double r73461 = log(r73456);
double r73462 = r73456 * r73461;
double r73463 = r73460 - r73462;
double r73464 = r73463 - r73457;
return r73464;
}
double f(double n) {
double r73465 = 1.0;
double r73466 = n;
double r73467 = r73465 / r73466;
double r73468 = 0.5;
double r73469 = 0.16666666666666669;
double r73470 = r73469 / r73466;
double r73471 = r73468 - r73470;
double r73472 = log(r73466);
double r73473 = 1.0;
double r73474 = r73472 * r73473;
double r73475 = fma(r73467, r73471, r73474);
return r73475;
}




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