\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 r61551 = n;
double r61552 = 1.0;
double r61553 = r61551 + r61552;
double r61554 = log(r61553);
double r61555 = r61553 * r61554;
double r61556 = log(r61551);
double r61557 = r61551 * r61556;
double r61558 = r61555 - r61557;
double r61559 = r61558 - r61552;
return r61559;
}
double f(double n) {
double r61560 = 1.0;
double r61561 = n;
double r61562 = r61560 / r61561;
double r61563 = 0.5;
double r61564 = 0.16666666666666669;
double r61565 = r61564 / r61561;
double r61566 = r61563 - r61565;
double r61567 = log(r61561);
double r61568 = 1.0;
double r61569 = r61567 * r61568;
double r61570 = fma(r61562, r61566, r61569);
return r61570;
}




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