\left(\left(n + 1\right) \cdot \log \left(n + 1\right) - n \cdot \log n\right) - 1
\left(\left(\left(\frac{0.5}{n} + 1\right) + 1 \cdot \log n\right) - \frac{0.1666666666666666851703837437526090070605}{n \cdot n}\right) - 1double f(double n) {
double r82495 = n;
double r82496 = 1.0;
double r82497 = r82495 + r82496;
double r82498 = log(r82497);
double r82499 = r82497 * r82498;
double r82500 = log(r82495);
double r82501 = r82495 * r82500;
double r82502 = r82499 - r82501;
double r82503 = r82502 - r82496;
return r82503;
}
double f(double n) {
double r82504 = 0.5;
double r82505 = n;
double r82506 = r82504 / r82505;
double r82507 = 1.0;
double r82508 = r82506 + r82507;
double r82509 = log(r82505);
double r82510 = r82507 * r82509;
double r82511 = r82508 + r82510;
double r82512 = 0.16666666666666669;
double r82513 = r82505 * r82505;
double r82514 = r82512 / r82513;
double r82515 = r82511 - r82514;
double r82516 = r82515 - r82507;
return r82516;
}




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