\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.16666666666666669}{n}, \log n \cdot 1\right)double f(double n) {
double r117156 = n;
double r117157 = 1.0;
double r117158 = r117156 + r117157;
double r117159 = log(r117158);
double r117160 = r117158 * r117159;
double r117161 = log(r117156);
double r117162 = r117156 * r117161;
double r117163 = r117160 - r117162;
double r117164 = r117163 - r117157;
return r117164;
}
double f(double n) {
double r117165 = 1.0;
double r117166 = n;
double r117167 = r117165 / r117166;
double r117168 = 0.5;
double r117169 = 0.16666666666666669;
double r117170 = r117169 / r117166;
double r117171 = r117168 - r117170;
double r117172 = log(r117166);
double r117173 = 1.0;
double r117174 = r117172 * r117173;
double r117175 = fma(r117167, r117171, r117174);
return r117175;
}




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