Average Error: 40.4 → 40.4
Time: 4.6s
Precision: binary64
\[\mathsf{log1p}\left(x\right) - \log \left(1 + x\right)\]
↓
\[\mathsf{log1p}\left(x\right) - \log \left(1 + x\right)\]
\mathsf{log1p}\left(x\right) - \log \left(1 + x\right)
↓
\mathsf{log1p}\left(x\right) - \log \left(1 + x\right)
double code(double x) {
	return ((double) (((double) log1p(x)) - ((double) log(((double) (1.0 + x))))));
}
↓
double code(double x) {
	return ((double) (((double) log1p(x)) - ((double) log(((double) (1.0 + x))))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 40.4

    \[\mathsf{log1p}\left(x\right) - \log \left(1 + x\right)\]

  2. Final simplification40.4

    \[\leadsto \mathsf{log1p}\left(x\right) - \log \left(1 + x\right)\]

Reproduce

herbie shell --seed 2020152 
(FPCore (x)
  :name "(- (log1p x) (log (+ 1 x)))"
  :precision binary64
  (- (log1p x) (log (+ 1.0 x))))