\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 r68531 = n;
double r68532 = 1.0;
double r68533 = r68531 + r68532;
double r68534 = log(r68533);
double r68535 = r68533 * r68534;
double r68536 = log(r68531);
double r68537 = r68531 * r68536;
double r68538 = r68535 - r68537;
double r68539 = r68538 - r68532;
return r68539;
}
double f(double n) {
double r68540 = 1.0;
double r68541 = n;
double r68542 = r68540 / r68541;
double r68543 = 0.5;
double r68544 = 0.16666666666666669;
double r68545 = r68544 / r68541;
double r68546 = r68543 - r68545;
double r68547 = log(r68541);
double r68548 = 1.0;
double r68549 = r68547 * r68548;
double r68550 = fma(r68542, r68546, r68549);
return r68550;
}




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