\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(1, -\log n, \frac{0.16666666666666669}{n \cdot n}\right)double f(double n) {
double r135529 = n;
double r135530 = 1.0;
double r135531 = r135529 + r135530;
double r135532 = log(r135531);
double r135533 = r135531 * r135532;
double r135534 = log(r135529);
double r135535 = r135529 * r135534;
double r135536 = r135533 - r135535;
double r135537 = r135536 - r135530;
return r135537;
}
double f(double n) {
double r135538 = 0.5;
double r135539 = n;
double r135540 = r135538 / r135539;
double r135541 = 1.0;
double r135542 = log(r135539);
double r135543 = -r135542;
double r135544 = 0.16666666666666669;
double r135545 = r135539 * r135539;
double r135546 = r135544 / r135545;
double r135547 = fma(r135541, r135543, r135546);
double r135548 = r135540 - r135547;
return r135548;
}




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