Average Error: 0.0 → 0.0
Time: 1.0s
Precision: binary64
\[{2}^{x} - {x}^{1}\]
↓
\[{2}^{x} - {x}^{1}\]
{2}^{x} - {x}^{1}
↓
{2}^{x} - {x}^{1}
double code(double x) {
	return ((double) (((double) pow(2.0, x)) - ((double) pow(x, 1.0))));
}
↓
double code(double x) {
	return ((double) (((double) pow(2.0, x)) - ((double) pow(x, 1.0))));
}

Error

Bits error versus x

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[{2}^{x} - {x}^{1}\]

  2. Final simplification0.0

    \[\leadsto {2}^{x} - {x}^{1}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (x)
  :name "(- (pow 2.0 x) (pow x 1.0))"
  :precision binary64
  (- (pow 2.0 x) (pow x 1.0)))