Average Error: 1.9 → 1.9
Time: 4.5s
Precision: 64
\[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}\]
↓
\[\frac{{k}^{m}}{k \cdot \left(10 + k\right) + 1} \cdot a\]
\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}
↓
\frac{{k}^{m}}{k \cdot \left(10 + k\right) + 1} \cdot a
double code(double a, double k, double m) {
	return ((a * pow(k, m)) / ((1.0 + (10.0 * k)) + (k * k)));
}
↓
double code(double a, double k, double m) {
	return ((pow(k, m) / ((k * (10.0 + k)) + 1.0)) * a);
}

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 1.9

    \[\frac{a \cdot {k}^{m}}{\left(1 + 10 \cdot k\right) + k \cdot k}\]

  2. Simplified1.9

    \[\leadsto \color{blue}{\frac{{k}^{m}}{k \cdot \left(10 + k\right) + 1} \cdot a}\]

  3. Final simplification1.9

    \[\leadsto \frac{{k}^{m}}{k \cdot \left(10 + k\right) + 1} \cdot a\]

Reproduce

herbie shell --seed 2020092 
(FPCore (a k m)
  :name "Falkner and Boettcher, Appendix A"
  :precision binary64
  (/ (* a (pow k m)) (+ (+ 1 (* 10 k)) (* k k))))