\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.16666666666666669}{n \cdot n}\right)double f(double n) {
double r146081 = n;
double r146082 = 1.0;
double r146083 = r146081 + r146082;
double r146084 = log(r146083);
double r146085 = r146083 * r146084;
double r146086 = log(r146081);
double r146087 = r146081 * r146086;
double r146088 = r146085 - r146087;
double r146089 = r146088 - r146082;
return r146089;
}
double f(double n) {
double r146090 = 0.5;
double r146091 = n;
double r146092 = r146090 / r146091;
double r146093 = 1.0;
double r146094 = log(r146091);
double r146095 = -r146094;
double r146096 = 0.16666666666666669;
double r146097 = r146091 * r146091;
double r146098 = r146096 / r146097;
double r146099 = fma(r146093, r146095, r146098);
double r146100 = r146092 - r146099;
return r146100;
}




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