\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(-\log n, 1, \frac{0.1666666666666666851703837437526090070605}{n \cdot n}\right)double f(double n) {
double r46268 = n;
double r46269 = 1.0;
double r46270 = r46268 + r46269;
double r46271 = log(r46270);
double r46272 = r46270 * r46271;
double r46273 = log(r46268);
double r46274 = r46268 * r46273;
double r46275 = r46272 - r46274;
double r46276 = r46275 - r46269;
return r46276;
}
double f(double n) {
double r46277 = 0.5;
double r46278 = n;
double r46279 = r46277 / r46278;
double r46280 = log(r46278);
double r46281 = -r46280;
double r46282 = 1.0;
double r46283 = 0.16666666666666669;
double r46284 = r46278 * r46278;
double r46285 = r46283 / r46284;
double r46286 = fma(r46281, r46282, r46285);
double r46287 = r46279 - r46286;
return r46287;
}




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