\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 r13911253 = n;
double r13911254 = 1.0;
double r13911255 = r13911253 + r13911254;
double r13911256 = log(r13911255);
double r13911257 = r13911255 * r13911256;
double r13911258 = log(r13911253);
double r13911259 = r13911253 * r13911258;
double r13911260 = r13911257 - r13911259;
double r13911261 = r13911260 - r13911254;
return r13911261;
}
double f(double n) {
double r13911262 = 0.5;
double r13911263 = n;
double r13911264 = r13911262 / r13911263;
double r13911265 = 0.16666666666666666;
double r13911266 = r13911263 * r13911263;
double r13911267 = r13911265 / r13911266;
double r13911268 = log(r13911263);
double r13911269 = r13911267 - r13911268;
double r13911270 = r13911264 - r13911269;
return r13911270;
}




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