?

Average Error: 0.0 → 0.0
Time: 2.3s
Precision: binary64
Cost: 6464

?

\[-1 \leq x \land x \leq 1.79 \cdot 10^{+308}\]
\[\mathsf{log1p}\left(x\right) \]
↓
\[\mathsf{log1p}\left(x\right) \]
(FPCore (x) :precision binary64 (log1p x))
↓
(FPCore (x) :precision binary64 (log1p x))
double code(double x) {
	return log1p(x);
}
↓
double code(double x) {
	return log1p(x);
}

public static double code(double x) {
	return Math.log1p(x);
}
↓
public static double code(double x) {
	return Math.log1p(x);
}

def code(x):
	return math.log1p(x)
↓
def code(x):
	return math.log1p(x)

function code(x)
	return log1p(x)
end
↓
function code(x)
	return log1p(x)
end

code[x_] := N[Log[1 + x], $MachinePrecision]
↓
code[x_] := N[Log[1 + x], $MachinePrecision]

\mathsf{log1p}\left(x\right)
↓
\mathsf{log1p}\left(x\right)

Error?

Try it out?

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation?

  1. Initial program 0.0

    \[\mathsf{log1p}\left(x\right) \]

  2. Final simplification0.0

    \[\leadsto \mathsf{log1p}\left(x\right) \]

Alternatives

Alternative 1
Error21.4
Cost64
\[x \]

Error

Reproduce?

herbie shell --seed 1 
(FPCore (x)
  :name "log1p(x)"
  :precision binary64
  :pre (and (<= -1.0 x) (<= x 1.79e+308))
  (log1p x))