\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 r52955 = n;
double r52956 = 1.0;
double r52957 = r52955 + r52956;
double r52958 = log(r52957);
double r52959 = r52957 * r52958;
double r52960 = log(r52955);
double r52961 = r52955 * r52960;
double r52962 = r52959 - r52961;
double r52963 = r52962 - r52956;
return r52963;
}
double f(double n) {
double r52964 = 1.0;
double r52965 = n;
double r52966 = r52964 / r52965;
double r52967 = 0.5;
double r52968 = 0.16666666666666669;
double r52969 = r52968 / r52965;
double r52970 = r52967 - r52969;
double r52971 = log(r52965);
double r52972 = 1.0;
double r52973 = r52971 * r52972;
double r52974 = fma(r52966, r52970, r52973);
return r52974;
}




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