\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\left(\frac{\frac{-1}{6}}{n \cdot n} + \log n\right) + \frac{\frac{1}{2}}{n}double f(double n) {
double r1675752 = n;
double r1675753 = 1.0;
double r1675754 = r1675752 + r1675753;
double r1675755 = log(r1675754);
double r1675756 = r1675754 * r1675755;
double r1675757 = log(r1675752);
double r1675758 = r1675752 * r1675757;
double r1675759 = r1675756 - r1675758;
double r1675760 = r1675759 - r1675753;
return r1675760;
}
double f(double n) {
double r1675761 = -0.16666666666666666;
double r1675762 = n;
double r1675763 = r1675762 * r1675762;
double r1675764 = r1675761 / r1675763;
double r1675765 = log(r1675762);
double r1675766 = r1675764 + r1675765;
double r1675767 = 0.5;
double r1675768 = r1675767 / r1675762;
double r1675769 = r1675766 + r1675768;
return r1675769;
}




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