Average Error: 2.0 → 2.0
Time: 4.4s
Precision: binary64
\[\]
↓
\[\]
↓
double code(double a, double k, double m) {
	return ((double) (((double) (a * ((double) pow(k, m)))) / ((double) (((double) (1.0 + ((double) (10.0 * k)))) + ((double) (k * k))))));
}

↓
double code(double a, double k, double m) {
	return ((double) (((double) (a * ((double) pow(k, m)))) / ((double) (1.0 + ((double) (k * ((double) (k + 10.0))))))));
}

Error
Bits error versus a
Bits error versus k
Bits error versus m
Try it out
Your Program's Arguments
Results
Enter valid numbers for all inputs
Derivation
  1. Initial program 2.0
    \[\]
  2. Simplified2.0
    \[\leadsto \]
  3. Using strategy rm
  4. Applied associate-*r/2.0
    \[\leadsto \]
  5. Final simplification2.0
    \[\leadsto \]
Reproduce
herbie shell --seed 2020192 
(FPCore (a k m)
  :name "Falkner and Boettcher, Appendix A"
  :precision binary64
  (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))