Average Error: 63.0 → 0
Time: 4.4s
Precision: binary64
\[\]
\[\]
↓
\[\]
↓
double code(double n) {
	return ((double) (((double) (((double) (((double) (n + 1.0)) * ((double) log(((double) (n + 1.0)))))) - ((double) (n * ((double) log(n)))))) - 1.0));
}

↓
double code(double n) {
	return ((double) (((double) (0.5 / n)) + ((double) (((double) (1.0 * ((double) log(n)))) - ((double) (0.16666666666666669 / ((double) (n * n))))))));
}

Error
Bits error versus n
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Target
Original63.0
Target0
Herbie0
\[\]
Derivation
  1. Initial program 63.0
    \[\]
  2. Simplified62.0
    \[\leadsto \]
  3. Taylor expanded around inf 0.0
    \[\leadsto \]
  4. Simplified0
    \[\leadsto \]
  5. Final simplification0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020191 
(FPCore (n)
  :name "logs (example 3.8)"
  :precision binary64
  :pre (> n 6.8e+15)

  :herbie-target
  (- (log (+ n 1.0)) (- (/ 1.0 (* 2.0 n)) (- (/ 1.0 (* 3.0 (* n n))) (/ 4.0 (pow n 3.0)))))

  (- (- (* (+ n 1.0) (log (+ n 1.0))) (* n (log n))) 1.0))