\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 r2090121 = n;
double r2090122 = 1.0;
double r2090123 = r2090121 + r2090122;
double r2090124 = log(r2090123);
double r2090125 = r2090123 * r2090124;
double r2090126 = log(r2090121);
double r2090127 = r2090121 * r2090126;
double r2090128 = r2090125 - r2090127;
double r2090129 = r2090128 - r2090122;
return r2090129;
}
double f(double n) {
double r2090130 = -0.16666666666666666;
double r2090131 = n;
double r2090132 = r2090131 * r2090131;
double r2090133 = r2090130 / r2090132;
double r2090134 = log(r2090131);
double r2090135 = r2090133 + r2090134;
double r2090136 = 0.5;
double r2090137 = r2090136 / r2090131;
double r2090138 = r2090135 + r2090137;
return r2090138;
}




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