\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 r45962 = n;
double r45963 = 1.0;
double r45964 = r45962 + r45963;
double r45965 = log(r45964);
double r45966 = r45964 * r45965;
double r45967 = log(r45962);
double r45968 = r45962 * r45967;
double r45969 = r45966 - r45968;
double r45970 = r45969 - r45963;
return r45970;
}
double f(double n) {
double r45971 = 1.0;
double r45972 = n;
double r45973 = r45971 / r45972;
double r45974 = 0.5;
double r45975 = 0.16666666666666669;
double r45976 = r45975 / r45972;
double r45977 = r45974 - r45976;
double r45978 = log(r45972);
double r45979 = 1.0;
double r45980 = r45978 * r45979;
double r45981 = fma(r45973, r45977, r45980);
return r45981;
}




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