\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 r97432 = n;
double r97433 = 1.0;
double r97434 = r97432 + r97433;
double r97435 = log(r97434);
double r97436 = r97434 * r97435;
double r97437 = log(r97432);
double r97438 = r97432 * r97437;
double r97439 = r97436 - r97438;
double r97440 = r97439 - r97433;
return r97440;
}
double f(double n) {
double r97441 = 1.0;
double r97442 = n;
double r97443 = r97441 / r97442;
double r97444 = 0.5;
double r97445 = 0.16666666666666669;
double r97446 = r97445 / r97442;
double r97447 = r97444 - r97446;
double r97448 = log(r97442);
double r97449 = 1.0;
double r97450 = r97448 * r97449;
double r97451 = fma(r97443, r97447, r97450);
return r97451;
}




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