\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.16666666666666669}{n}, \log n \cdot 1\right)double f(double n) {
double r88638 = n;
double r88639 = 1.0;
double r88640 = r88638 + r88639;
double r88641 = log(r88640);
double r88642 = r88640 * r88641;
double r88643 = log(r88638);
double r88644 = r88638 * r88643;
double r88645 = r88642 - r88644;
double r88646 = r88645 - r88639;
return r88646;
}
double f(double n) {
double r88647 = 1.0;
double r88648 = n;
double r88649 = r88647 / r88648;
double r88650 = 0.5;
double r88651 = 0.16666666666666669;
double r88652 = r88651 / r88648;
double r88653 = r88650 - r88652;
double r88654 = log(r88648);
double r88655 = 1.0;
double r88656 = r88654 * r88655;
double r88657 = fma(r88649, r88653, r88656);
return r88657;
}




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