\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 r80551 = n;
double r80552 = 1.0;
double r80553 = r80551 + r80552;
double r80554 = log(r80553);
double r80555 = r80553 * r80554;
double r80556 = log(r80551);
double r80557 = r80551 * r80556;
double r80558 = r80555 - r80557;
double r80559 = r80558 - r80552;
return r80559;
}
double f(double n) {
double r80560 = 1.0;
double r80561 = n;
double r80562 = r80560 / r80561;
double r80563 = 0.5;
double r80564 = 0.16666666666666669;
double r80565 = r80564 / r80561;
double r80566 = r80563 - r80565;
double r80567 = log(r80561);
double r80568 = 1.0;
double r80569 = r80567 * r80568;
double r80570 = fma(r80562, r80566, r80569);
return r80570;
}




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