\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\mathsf{fma}\left(\frac{1}{n}, 0.5 - \frac{0.1666666666666666851703837437526090070605}{n}, \log n \cdot 1\right)double f(double n) {
double r62127 = n;
double r62128 = 1.0;
double r62129 = r62127 + r62128;
double r62130 = log(r62129);
double r62131 = r62129 * r62130;
double r62132 = log(r62127);
double r62133 = r62127 * r62132;
double r62134 = r62131 - r62133;
double r62135 = r62134 - r62128;
return r62135;
}
double f(double n) {
double r62136 = 1.0;
double r62137 = n;
double r62138 = r62136 / r62137;
double r62139 = 0.5;
double r62140 = 0.16666666666666669;
double r62141 = r62140 / r62137;
double r62142 = r62139 - r62141;
double r62143 = log(r62137);
double r62144 = 1.0;
double r62145 = r62143 * r62144;
double r62146 = fma(r62138, r62142, r62145);
return r62146;
}




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