\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 r66628 = n;
double r66629 = 1.0;
double r66630 = r66628 + r66629;
double r66631 = log(r66630);
double r66632 = r66630 * r66631;
double r66633 = log(r66628);
double r66634 = r66628 * r66633;
double r66635 = r66632 - r66634;
double r66636 = r66635 - r66629;
return r66636;
}
double f(double n) {
double r66637 = 0.5;
double r66638 = n;
double r66639 = r66637 / r66638;
double r66640 = log(r66638);
double r66641 = -r66640;
double r66642 = 1.0;
double r66643 = 0.16666666666666669;
double r66644 = r66638 * r66638;
double r66645 = r66643 / r66644;
double r66646 = fma(r66641, r66642, r66645);
double r66647 = r66639 - r66646;
return r66647;
}




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