\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 r67439 = n;
double r67440 = 1.0;
double r67441 = r67439 + r67440;
double r67442 = log(r67441);
double r67443 = r67441 * r67442;
double r67444 = log(r67439);
double r67445 = r67439 * r67444;
double r67446 = r67443 - r67445;
double r67447 = r67446 - r67440;
return r67447;
}
double f(double n) {
double r67448 = 1.0;
double r67449 = n;
double r67450 = r67448 / r67449;
double r67451 = 0.5;
double r67452 = 0.16666666666666669;
double r67453 = r67452 / r67449;
double r67454 = r67451 - r67453;
double r67455 = log(r67449);
double r67456 = 1.0;
double r67457 = r67455 * r67456;
double r67458 = fma(r67450, r67454, r67457);
return r67458;
}




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