\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\frac{0.5}{n} - \mathsf{fma}\left(1, -\log n, \frac{0.1666666666666666851703837437526090070605}{n \cdot n}\right)double f(double n) {
double r99113 = n;
double r99114 = 1.0;
double r99115 = r99113 + r99114;
double r99116 = log(r99115);
double r99117 = r99115 * r99116;
double r99118 = log(r99113);
double r99119 = r99113 * r99118;
double r99120 = r99117 - r99119;
double r99121 = r99120 - r99114;
return r99121;
}
double f(double n) {
double r99122 = 0.5;
double r99123 = n;
double r99124 = r99122 / r99123;
double r99125 = 1.0;
double r99126 = log(r99123);
double r99127 = -r99126;
double r99128 = 0.16666666666666669;
double r99129 = r99123 * r99123;
double r99130 = r99128 / r99129;
double r99131 = fma(r99125, r99127, r99130);
double r99132 = r99124 - r99131;
return r99132;
}




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