Average Error: 28.9 → 28.9
Time: 2.4s
Precision: binary64
Cost: 13120
\[\log \left(N + 1\right) - \log N\]
↓
\[\log \left(N + 1\right) - \log N\]
\log \left(N + 1\right) - \log N
↓
\log \left(N + 1\right) - \log N
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
↓
(FPCore (N) :precision binary64 (- (log (+ N 1.0)) (log N)))
double code(double N) {
	return log(N + 1.0) - log(N);
}
↓
double code(double N) {
	return log(N + 1.0) - log(N);
}

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 28.9

    \[\log \left(N + 1\right) - \log N\]

  2. Simplified28.9

    \[\leadsto \color{blue}{\log \left(N + 1\right) - \log N}\]

  3. Final simplification28.9

    \[\leadsto \log \left(N + 1\right) - \log N\]

Reproduce

herbie shell --seed 2021023 
(FPCore (N)
  :name "2log (problem 3.3.6)"
  :precision binary64
  (- (log (+ N 1.0)) (log N)))