\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 r78747 = n;
double r78748 = 1.0;
double r78749 = r78747 + r78748;
double r78750 = log(r78749);
double r78751 = r78749 * r78750;
double r78752 = log(r78747);
double r78753 = r78747 * r78752;
double r78754 = r78751 - r78753;
double r78755 = r78754 - r78748;
return r78755;
}
double f(double n) {
double r78756 = 0.5;
double r78757 = n;
double r78758 = r78756 / r78757;
double r78759 = log(r78757);
double r78760 = -r78759;
double r78761 = 1.0;
double r78762 = 0.16666666666666669;
double r78763 = r78757 * r78757;
double r78764 = r78762 / r78763;
double r78765 = fma(r78760, r78761, r78764);
double r78766 = r78758 - r78765;
return r78766;
}




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