\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{\frac{1}{2}}{n} - \left(\frac{\frac{1}{6}}{n \cdot n} - \log n\right)double f(double n) {
double r3873392 = n;
double r3873393 = 1.0;
double r3873394 = r3873392 + r3873393;
double r3873395 = log(r3873394);
double r3873396 = r3873394 * r3873395;
double r3873397 = log(r3873392);
double r3873398 = r3873392 * r3873397;
double r3873399 = r3873396 - r3873398;
double r3873400 = r3873399 - r3873393;
return r3873400;
}
double f(double n) {
double r3873401 = 0.5;
double r3873402 = n;
double r3873403 = r3873401 / r3873402;
double r3873404 = 0.16666666666666666;
double r3873405 = r3873402 * r3873402;
double r3873406 = r3873404 / r3873405;
double r3873407 = log(r3873402);
double r3873408 = r3873406 - r3873407;
double r3873409 = r3873403 - r3873408;
return r3873409;
}




Bits error versus n
Results
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0.0 |
Initial program 63.0
Taylor expanded around inf 0.0
Simplified0.0
Taylor expanded around -inf 62.0
Simplified0.0
Final simplification0.0
herbie shell --seed 2019112
(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))