\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 r101283 = n;
double r101284 = 1.0;
double r101285 = r101283 + r101284;
double r101286 = log(r101285);
double r101287 = r101285 * r101286;
double r101288 = log(r101283);
double r101289 = r101283 * r101288;
double r101290 = r101287 - r101289;
double r101291 = r101290 - r101284;
return r101291;
}
double f(double n) {
double r101292 = 1.0;
double r101293 = n;
double r101294 = r101292 / r101293;
double r101295 = 0.5;
double r101296 = 0.16666666666666669;
double r101297 = r101296 / r101293;
double r101298 = r101295 - r101297;
double r101299 = log(r101293);
double r101300 = 1.0;
double r101301 = r101299 * r101300;
double r101302 = fma(r101294, r101298, r101301);
return r101302;
}




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