Average Error: 0.0 → 0.0
Time: 2.0s
Precision: binary64
\[{a}^{x} + b \cdot x\]
↓
\[{a}^{x} + b \cdot x\]
{a}^{x} + b \cdot x
↓
{a}^{x} + b \cdot x
double code(double a, double x, double b) {
	return ((double) (((double) pow(a, x)) + ((double) (b * x))));
}
↓
double code(double a, double x, double b) {
	return ((double) (((double) pow(a, x)) + ((double) (b * x))));
}

Error

Bits error versus a

Bits error versus x

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.0

    \[{a}^{x} + b \cdot x\]

  2. Final simplification0.0

    \[\leadsto {a}^{x} + b \cdot x\]

Reproduce

herbie shell --seed 2020153 
(FPCore (a x b)
  :name "(+ (pow a x) (* b x))"
  :precision binary64
  (+ (pow a x) (* b x)))