\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\mathsf{fma}\left(\frac{1}{n}, 0.5 - \frac{0.1666666666666666851703837437526090070605}{n}, \log n \cdot 1\right)double f(double n) {
double r53766 = n;
double r53767 = 1.0;
double r53768 = r53766 + r53767;
double r53769 = log(r53768);
double r53770 = r53768 * r53769;
double r53771 = log(r53766);
double r53772 = r53766 * r53771;
double r53773 = r53770 - r53772;
double r53774 = r53773 - r53767;
return r53774;
}
double f(double n) {
double r53775 = 1.0;
double r53776 = n;
double r53777 = r53775 / r53776;
double r53778 = 0.5;
double r53779 = 0.16666666666666669;
double r53780 = r53779 / r53776;
double r53781 = r53778 - r53780;
double r53782 = log(r53776);
double r53783 = 1.0;
double r53784 = r53782 * r53783;
double r53785 = fma(r53777, r53781, r53784);
return r53785;
}




Bits error versus n
| Original | 63.0 |
|---|---|
| Target | 0 |
| Herbie | 0 |
Initial program 63.0
Simplified61.9
Taylor expanded around inf 0.0
Simplified0
Final simplification0
herbie shell --seed 2019346 +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))