Average Error: 0.6 → 0.6
Time: 8.8s
Precision: binary64
\[\frac{{p}^{t}}{{b}^{\left(\frac{t + 1}{2}\right)}}\]
↓
\[\frac{{p}^{t}}{{b}^{\left(\frac{t + 1}{2}\right)}}\]
\frac{{p}^{t}}{{b}^{\left(\frac{t + 1}{2}\right)}}
↓
\frac{{p}^{t}}{{b}^{\left(\frac{t + 1}{2}\right)}}
double code(double p, double t, double b) {
	return ((double) (((double) pow(p, t)) / ((double) pow(b, ((double) (((double) (t + 1.0)) / 2.0))))));
}
↓
double code(double p, double t, double b) {
	return ((double) (((double) pow(p, t)) / ((double) pow(b, ((double) (((double) (t + 1.0)) / 2.0))))));
}

Error

Bits error versus p

Bits error versus t

Bits error versus b

Try it out

Your Program's Arguments

Results

Enter valid numbers for all inputs

Derivation

  1. Initial program 0.6

    \[\frac{{p}^{t}}{{b}^{\left(\frac{t + 1}{2}\right)}}\]

  2. Final simplification0.6

    \[\leadsto \frac{{p}^{t}}{{b}^{\left(\frac{t + 1}{2}\right)}}\]

Reproduce

herbie shell --seed 2020153 
(FPCore (p t b)
  :name "(/ (pow p t) (pow b (/ (+ t 1) 2)))"
  :precision binary64
  (/ (pow p t) (pow b (/ (+ t 1.0) 2.0))))