Average Error: 0.0 → 0.0
Time: 2.9s
Precision: binary64
Cost: 6656
$-1000 \leq x \land x \leq 1000$
${x}^{100} - x$
${x}^{100} - x$
(FPCore (x) :precision binary64 (- (pow x 100.0) x))
(FPCore (x) :precision binary64 (- (pow x 100.0) x))
double code(double x) {
return pow(x, 100.0) - x;
}

double code(double x) {
return pow(x, 100.0) - x;
}

real(8) function code(x)
real(8), intent (in) :: x
code = (x ** 100.0d0) - x
end function

real(8) function code(x)
real(8), intent (in) :: x
code = (x ** 100.0d0) - x
end function

public static double code(double x) {
return Math.pow(x, 100.0) - x;
}

public static double code(double x) {
return Math.pow(x, 100.0) - x;
}

def code(x):
return math.pow(x, 100.0) - x

def code(x):
return math.pow(x, 100.0) - x

function code(x)
return Float64((x ^ 100.0) - x)
end

function code(x)
return Float64((x ^ 100.0) - x)
end

function tmp = code(x)
tmp = (x ^ 100.0) - x;
end

function tmp = code(x)
tmp = (x ^ 100.0) - x;
end

code[x_] := N[(N[Power[x, 100.0], $MachinePrecision] - x),$MachinePrecision]

code[x_] := N[(N[Power[x, 100.0], $MachinePrecision] - x),$MachinePrecision]

{x}^{100} - x

{x}^{100} - x


# Try it out

Results

 In Out
Enter valid numbers for all inputs

# Derivation

1. Initial program 0.0

${x}^{100} - x$
2. Final simplification0.0

$\leadsto {x}^{100} - x$

# Alternatives

Alternative 1
Error0.6
Cost128
$-x$

# Reproduce

herbie shell --seed 1
(FPCore (x)
:name "x^100-x"
:precision binary64
:pre (and (<= -1000.0 x) (<= x 1000.0))
(- (pow x 100.0) x))