\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 r60652 = n;
double r60653 = 1.0;
double r60654 = r60652 + r60653;
double r60655 = log(r60654);
double r60656 = r60654 * r60655;
double r60657 = log(r60652);
double r60658 = r60652 * r60657;
double r60659 = r60656 - r60658;
double r60660 = r60659 - r60653;
return r60660;
}
double f(double n) {
double r60661 = 0.5;
double r60662 = n;
double r60663 = r60661 / r60662;
double r60664 = log(r60662);
double r60665 = -r60664;
double r60666 = 1.0;
double r60667 = 0.16666666666666669;
double r60668 = r60662 * r60662;
double r60669 = r60667 / r60668;
double r60670 = fma(r60665, r60666, r60669);
double r60671 = r60663 - r60670;
return r60671;
}




Bits error versus n
| Original | 63.0 |
|---|---|
| Target | 0.0 |
| Herbie | 0 |
Initial program 63.0
Simplified62.0
Taylor expanded around inf 0.0
Simplified0
Final simplification0
herbie shell --seed 2019304 +o rules:numerics
(FPCore (n)
:name "logs (example 3.8)"
:precision binary64
:pre (> n 6.8e15)
: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))