\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\left(\frac{\frac{-1}{6}}{n \cdot n} + \log n\right) + \frac{\frac{1}{2}}{n}double f(double n) {
double r2198279 = n;
double r2198280 = 1.0;
double r2198281 = r2198279 + r2198280;
double r2198282 = log(r2198281);
double r2198283 = r2198281 * r2198282;
double r2198284 = log(r2198279);
double r2198285 = r2198279 * r2198284;
double r2198286 = r2198283 - r2198285;
double r2198287 = r2198286 - r2198280;
return r2198287;
}
double f(double n) {
double r2198288 = -0.16666666666666666;
double r2198289 = n;
double r2198290 = r2198289 * r2198289;
double r2198291 = r2198288 / r2198290;
double r2198292 = log(r2198289);
double r2198293 = r2198291 + r2198292;
double r2198294 = 0.5;
double r2198295 = r2198294 / r2198289;
double r2198296 = r2198293 + r2198295;
return r2198296;
}




Bits error versus n
Results
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0 |
Initial program 63.0
Simplified44.2
Taylor expanded around inf 0.0
Simplified0
Final simplification0
herbie shell --seed 2019141 +o rules:numerics
(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))