Average Error: 30.7 → 30.7
Time: 2.5s
Precision: binary64
\[\left(\left(N + 1\right) \cdot \log \left(N + 1\right) - N \cdot \log N\right) - 1\]
↓
\[\left(\left(N + 1\right) \cdot \log \left(N + 1\right) - N \cdot \log N\right) - 1\]
\left(\left(N + 1\right) \cdot \log \left(N + 1\right) - N \cdot \log N\right) - 1
↓
\left(\left(N + 1\right) \cdot \log \left(N + 1\right) - N \cdot \log N\right) - 1
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) (((double) (((double) (N + 1.0)) * ((double) log(((double) (N + 1.0)))))) - ((double) (N * ((double) log(N)))))) - 1.0));
}

Error

Bits error versus N

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 30.7

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

  2. Final simplification30.7

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

Reproduce

herbie shell --seed 2020153 
(FPCore (N)
  :name "(- (- (* (+ N 1.0) (log (+ N 1.0))) (* N (log N))) 1.0)"
  :precision binary64
  (- (- (* (+ N 1.0) (log (+ N 1.0))) (* N (log N))) 1.0))