\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 r81913 = n;
double r81914 = 1.0;
double r81915 = r81913 + r81914;
double r81916 = log(r81915);
double r81917 = r81915 * r81916;
double r81918 = log(r81913);
double r81919 = r81913 * r81918;
double r81920 = r81917 - r81919;
double r81921 = r81920 - r81914;
return r81921;
}
double f(double n) {
double r81922 = 1.0;
double r81923 = n;
double r81924 = r81922 / r81923;
double r81925 = 0.5;
double r81926 = 0.16666666666666669;
double r81927 = r81926 / r81923;
double r81928 = r81925 - r81927;
double r81929 = log(r81923);
double r81930 = 1.0;
double r81931 = r81929 * r81930;
double r81932 = fma(r81924, r81928, r81931);
return r81932;
}




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