\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(1, -\log n, \frac{0.1666666666666666851703837437526090070605}{n \cdot n}\right)double f(double n) {
double r27451 = n;
double r27452 = 1.0;
double r27453 = r27451 + r27452;
double r27454 = log(r27453);
double r27455 = r27453 * r27454;
double r27456 = log(r27451);
double r27457 = r27451 * r27456;
double r27458 = r27455 - r27457;
double r27459 = r27458 - r27452;
return r27459;
}
double f(double n) {
double r27460 = 0.5;
double r27461 = n;
double r27462 = r27460 / r27461;
double r27463 = 1.0;
double r27464 = log(r27461);
double r27465 = -r27464;
double r27466 = 0.16666666666666669;
double r27467 = r27461 * r27461;
double r27468 = r27466 / r27467;
double r27469 = fma(r27463, r27465, r27468);
double r27470 = r27462 - r27469;
return r27470;
}




Bits error versus n
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0 |
Initial program 63.0
Simplified62.0
Taylor expanded around inf 0.0
Simplified0
Final simplification0
herbie shell --seed 2019212 +o rules:numerics
(FPCore (n)
:name "logs (example 3.8)"
:precision binary64
:pre (> n 6.8e15)
: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))