\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 r63893 = n;
double r63894 = 1.0;
double r63895 = r63893 + r63894;
double r63896 = log(r63895);
double r63897 = r63895 * r63896;
double r63898 = log(r63893);
double r63899 = r63893 * r63898;
double r63900 = r63897 - r63899;
double r63901 = r63900 - r63894;
return r63901;
}
double f(double n) {
double r63902 = 1.0;
double r63903 = n;
double r63904 = r63902 / r63903;
double r63905 = 0.5;
double r63906 = 0.16666666666666669;
double r63907 = r63906 / r63903;
double r63908 = r63905 - r63907;
double r63909 = log(r63903);
double r63910 = 1.0;
double r63911 = r63909 * r63910;
double r63912 = fma(r63904, r63908, r63911);
return r63912;
}




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