\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.16666666666666669}{n \cdot n}\right)double f(double n) {
double r59483 = n;
double r59484 = 1.0;
double r59485 = r59483 + r59484;
double r59486 = log(r59485);
double r59487 = r59485 * r59486;
double r59488 = log(r59483);
double r59489 = r59483 * r59488;
double r59490 = r59487 - r59489;
double r59491 = r59490 - r59484;
return r59491;
}
double f(double n) {
double r59492 = 0.5;
double r59493 = n;
double r59494 = r59492 / r59493;
double r59495 = 1.0;
double r59496 = log(r59493);
double r59497 = -r59496;
double r59498 = 0.16666666666666669;
double r59499 = r59493 * r59493;
double r59500 = r59498 / r59499;
double r59501 = fma(r59495, r59497, r59500);
double r59502 = r59494 - r59501;
return r59502;
}




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