\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\left(\log n \cdot 1 + \frac{0.5}{n}\right) - \frac{0.1666666666666666851703837437526090070605}{{n}^{2}}double f(double n) {
double r71415 = n;
double r71416 = 1.0;
double r71417 = r71415 + r71416;
double r71418 = log(r71417);
double r71419 = r71417 * r71418;
double r71420 = log(r71415);
double r71421 = r71415 * r71420;
double r71422 = r71419 - r71421;
double r71423 = r71422 - r71416;
return r71423;
}
double f(double n) {
double r71424 = n;
double r71425 = log(r71424);
double r71426 = 1.0;
double r71427 = r71425 * r71426;
double r71428 = 0.5;
double r71429 = r71428 / r71424;
double r71430 = r71427 + r71429;
double r71431 = 0.16666666666666669;
double r71432 = 2.0;
double r71433 = pow(r71424, r71432);
double r71434 = r71431 / r71433;
double r71435 = r71430 - r71434;
return r71435;
}




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