\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 r86643 = n;
double r86644 = 1.0;
double r86645 = r86643 + r86644;
double r86646 = log(r86645);
double r86647 = r86645 * r86646;
double r86648 = log(r86643);
double r86649 = r86643 * r86648;
double r86650 = r86647 - r86649;
double r86651 = r86650 - r86644;
return r86651;
}
double f(double n) {
double r86652 = 0.5;
double r86653 = n;
double r86654 = r86652 / r86653;
double r86655 = log(r86653);
double r86656 = -r86655;
double r86657 = 1.0;
double r86658 = 0.16666666666666669;
double r86659 = r86653 * r86653;
double r86660 = r86658 / r86659;
double r86661 = fma(r86656, r86657, r86660);
double r86662 = r86654 - r86661;
return r86662;
}




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