\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(-\log n, 1, \frac{0.1666666666666666851703837437526090070605}{n \cdot n}\right)double f(double n) {
double r78879 = n;
double r78880 = 1.0;
double r78881 = r78879 + r78880;
double r78882 = log(r78881);
double r78883 = r78881 * r78882;
double r78884 = log(r78879);
double r78885 = r78879 * r78884;
double r78886 = r78883 - r78885;
double r78887 = r78886 - r78880;
return r78887;
}
double f(double n) {
double r78888 = 0.5;
double r78889 = n;
double r78890 = r78888 / r78889;
double r78891 = log(r78889);
double r78892 = -r78891;
double r78893 = 1.0;
double r78894 = 0.16666666666666669;
double r78895 = r78889 * r78889;
double r78896 = r78894 / r78895;
double r78897 = fma(r78892, r78893, r78896);
double r78898 = r78890 - r78897;
return r78898;
}




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