\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{\frac{1}{2}}{n} - \left(\frac{\frac{1}{6}}{n \cdot n} - \log n\right)double f(double n) {
double r10610867 = n;
double r10610868 = 1.0;
double r10610869 = r10610867 + r10610868;
double r10610870 = log(r10610869);
double r10610871 = r10610869 * r10610870;
double r10610872 = log(r10610867);
double r10610873 = r10610867 * r10610872;
double r10610874 = r10610871 - r10610873;
double r10610875 = r10610874 - r10610868;
return r10610875;
}
double f(double n) {
double r10610876 = 0.5;
double r10610877 = n;
double r10610878 = r10610876 / r10610877;
double r10610879 = 0.16666666666666666;
double r10610880 = r10610877 * r10610877;
double r10610881 = r10610879 / r10610880;
double r10610882 = log(r10610877);
double r10610883 = r10610881 - r10610882;
double r10610884 = r10610878 - r10610883;
return r10610884;
}




Bits error versus n
Results
| 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 2019107 +o rules:numerics
(FPCore (n)
:name "logs (example 3.8)"
: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))