Average Error: 1.9 → 0.2
Time: 5.8s
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) {
	double VAR;
	if ((k <= 7.430325758544677e+150)) {
		VAR = ((double) (((double) (a / ((double) sqrt(((double) (1.0 + ((double) (k * ((double) (k + 10.0)))))))))) * ((double) (((double) pow(k, m)) / ((double) sqrt(((double) (1.0 + ((double) (k * ((double) (k + 10.0))))))))))));
	} else {
		VAR = ((double) (((double) (((double) (((double) pow(((double) exp(m)), ((double) log(k)))) / k)) * ((double) (a / k)))) + ((double) (((double) (((double) (((double) pow(((double) exp(m)), ((double) log(k)))) / k)) * ((double) (a / k)))) * ((double) (((double) (99.0 / ((double) (k * k)))) - ((double) (10.0 / k))))))));
	}
	return VAR;
}

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. Split input into 2 regimes
  2. if  k  < 7.43032575854467656e150
    1. Initial program 0.1
      \[\]
    2. Using strategy rm
    3. Applied add-sqr-sqrt0.2
      \[\leadsto \]
    4. Applied times-frac0.2
      \[\leadsto \]
    5. Simplified0.2
      \[\leadsto \]
    6. Simplified0.2
      \[\leadsto \]
    if 7.43032575854467656e150 <  k 
    1. Initial program 9.5
      \[\]
    2. Using strategy rm
    3. Applied add-sqr-sqrt9.5
      \[\leadsto \]
    4. Applied times-frac9.5
      \[\leadsto \]
    5. Simplified9.5
      \[\leadsto \]
    6. Simplified9.5
      \[\leadsto \]
    7. Taylor expanded around inf 9.5
      \[\leadsto \]
    8. Simplified0.1
      \[\leadsto \]
  3. Recombined 2 regimes into one program.
  4. Final simplification0.2
    \[\leadsto \]
Reproduce
herbie shell --seed 2020181 
(FPCore (a k m)
  :name "Falkner and Boettcher, Appendix A"
  :precision binary64
  (/ (* a (pow k m)) (+ (+ 1.0 (* 10.0 k)) (* k k))))