\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\mathsf{fma}\left(\frac{1}{n}, \frac{1}{2} - \frac{\frac{1}{6}}{n}, \log n\right)double f(double n) {
double r1308590 = n;
double r1308591 = 1.0;
double r1308592 = r1308590 + r1308591;
double r1308593 = log(r1308592);
double r1308594 = r1308592 * r1308593;
double r1308595 = log(r1308590);
double r1308596 = r1308590 * r1308595;
double r1308597 = r1308594 - r1308596;
double r1308598 = r1308597 - r1308591;
return r1308598;
}
double f(double n) {
double r1308599 = 1.0;
double r1308600 = n;
double r1308601 = r1308599 / r1308600;
double r1308602 = 0.5;
double r1308603 = 0.16666666666666666;
double r1308604 = r1308603 / r1308600;
double r1308605 = r1308602 - r1308604;
double r1308606 = log(r1308600);
double r1308607 = fma(r1308601, r1308605, r1308606);
return r1308607;
}




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 2019154 +o rules:numerics
(FPCore (n)
:name "logs (example 3.8)"
: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))